Basic Gcd Problem

Basic Gcd Problem

时间限制: 2 Sec 内存限制: 256 MB

题目描述

As a great ACMer, $ZYB$ is also good at math and number theory.

$ZYB$ constructs a function $f_c(x)$ such that:
$$\begin{gathered} f_c(x)=\underset{i=1...x-1}{\max }c\cdot f_c(gcd(i,x))x>1 \\ {f}_c(x)=1x>1 \end{gathered}$$
Give some positive integer pairs $(n_i,c_i)$, ZYB wants to know $f_{c_i}(n_i)$ mod ($10^9+7$).

输入

The input contains multiple test cases. The first line of input contains one integer $T(1\le T\le 10^6)$.
In the following $T$ lines, each line contains two integers $n_i,c_i(1\le n_i,c_i\le 10^6)$ describing one question.

输出

For each test case, output one integer indicating the answer.

样例输入

2
3 3
10 5

样例输出

3
25

思路

观察这个函数可得
$$\begin{gathered} n=p_1^{a_1}{p}_2^{a_2}{p}_3^{a_3}...p_k^{a_k} \\ m=\sum _{i=1}^k{a}_i \\ ans=c^m \end{gathered}$$

#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int maxn = 1e6+10;
int prime[maxn + 10] , vis[maxn + 10],tot;
inline void prework() {
    for (int i = 2; i <= maxn; i++) {
        if (vis[i] == 0) {
            vis[i] = i;
            prime[tot++] = i;
        }
        for (int j = 0; j < tot && 1ll * prime[j] * i <= maxn; j++) {
            vis[i * prime[j]] = prime[j];
            if (i % prime[j] == 0) break;
        }
    }
}
int qpow(int a,int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = 1ll * res * a % mod;
        b >>= 1;
        a = 1ll * a * a % mod;
    }
    return res;
}
int n,c;
inline void work() {
    int k = 0;
    scanf("%d%d", &n, &c);
    while (n > 1) {
        k++;
        n /= vis[n];
    }
    printf("%d\n", qpow(c, k));
}
int main() {
    prework();
    int T = 1;
    scanf("%d", &T);
    while (T--) {
        work();
    }
    return 0;
}