C. Primes and Multiplication----数学+快速幂+思维

第二天叫醒我的不是闹钟，是梦想！

Let’s introduce some definitions that will be needed later.

Let prime(x) be the set of prime divisors of x. For example, prime(140)={2,5,7}, prime(169)={13}.

Let g(x,p) be the maximum possible integer pk where k is an integer such that x is divisible by pk. For example:

g(45,3)=9 (45 is divisible by 32=9 but not divisible by 33=27),
g(63,7)=7 (63 is divisible by 71=7 but not divisible by 72=49).
Let f(x,y) be the product of g(y,p) for all p in prime(x). For example:

f(30,70)=g(70,2)⋅g(70,3)⋅g(70,5)=21⋅30⋅51=10,
f(525,63)=g(63,3)⋅g(63,5)⋅g(63,7)=32⋅50⋅71=63.
You have integers x and n. Calculate f(x,1)⋅f(x,2)⋅…⋅f(x,n)mod(109+7).

Input
The only line contains integers x and n (2≤x≤109, 1≤n≤1018) — the numbers used in formula.

Output
Print the answer.

Examples
inputCopy
10 2
outputCopy
2
inputCopy
20190929 1605
outputCopy
363165664
inputCopy
947 987654321987654321
outputCopy
593574252
Note
In the first example, f(10,1)=g(1,2)⋅g(1,5)=1, f(10,2)=g(2,2)⋅g(2,5)=2.

In the second example, actual value of formula is approximately 1.597⋅10171. Make sure you print the answer modulo (109+7).

In the third example, be careful about overflow issue.

//我们先来解释一下 g函数是干嘛的，g(x,y) x能被y的最大次幂整除。
f(x,n) 表示1-n,最大次幂乘积。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
ll prime[100005];
int cnt=0;
ll x,n;
ll quick(ll a,ll b)
{
  ll res=1;
  while(b)
  {
    if(b&1) res=(res*a)%MOD;
    a=(a*a)%MOD;
    b>>=1;
  }
  return res;
}
void init(ll x)
{
  ll m=sqrt(x);
  for(int i=2;i<=m;i++)
  {
    if(x%i==0)
    {
      prime[++cnt]=i;
      while(x%i==0)
      {
        x/=i;
      }
    }
  }
  if(x>1) prime[++cnt]=x;
}
ll g(ll n,ll m)
{
  ll res=0;
  for(ll i=m;i<=n;i)
  {
    res+=(n/i);
    n/=i;
  }
  return quick(m,res);
}
int main()
{
    scanf("%lld %lld",&x,&n);
    init(x);
    ll res=1;
    for(int i=1;i<=cnt;i++)
    {
      ll ans=1;
      ans=g(n,prime[i]);
      res=(res*ans)%MOD;
    }
    cout<<res<<endl;
}