2020牛客暑期多校训练营（第四场）B题

链接：https://ac.nowcoder.com/acm/contest/5669/B
来源：牛客网

#pragma warning (disable:4996)
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <cstdio>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#define inf 0X7f7f7f7f
#define MS_I(x) memset(x,-inf,sizeof(x))
#define MS(x) memset(x,0,sizeof(x))
#define MS_1(x) memset(x,-1,sizeof(x))
#define MSI(x) memset(x,inf,sizeof(x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

const int P = 1e9 + 7;
int n, c;
const int maxn = 1e7 + 10;

int prime[maxn];
int visit[maxn];
int Prime() {
    for (int i = 2; i <= maxn; i++) {
        if (!visit[i]) {
            prime[++prime[0]] = i;      //纪录素数， 这个prime[0] 相当于 cnt，用来计数
        }
        for (int j = 1; j <= prime[0] && i * prime[j] <= maxn; j++) {
            //            cout<<"  j = "<<j<<" prime["<<j<<"]"<<" = "<<prime[j]<<" i*prime[j] = "<<i*prime[j]<<endl;
            visit[i * prime[j]] = 1;
            if (i % prime[j] == 0) {
                break;
            }
        }
    }
    return prime[0];
}

int divide(int n, int inum)
{
    int times = 0;
    for (int i = 1; (prime[i] <= sqrt(n)) && (i < inum); i++)
    {
        while (n % prime[i] == 0)
            n /= prime[i], times++;// cout << "n:" << n << ends << "prime[i]:" << prime[i] << ends << i << "times:" << times << endl, getchar();
    }
    if (n > 1)
        times++;
    return times;
}

int qpow(int a, int b)
{
    int ans = 1;
    for (; b; b >>= 1)
    {
        if (b & 1)
            ans = (ll)ans * a % P;
        a = (ll)a * a % P;
    }
    return ans;
}

int main()
{
    int t;
    scanf("%d", &t);
    int num = Prime();
    while (t--)
    {
        scanf("%d %d", &n, &c);
        printf("%d\n", qpow(c, divide(n, num)) % P);
    }
    return 0;
}