C. Primes and Multiplication
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Let's introduce some definitions that will be needed later.
Let prime(x)prime(x) be the set of prime divisors of xx. For example, prime(140)={2,5,7}prime(140)={2,5,7}, prime(169)={13}prime(169)={13}.
Let g(x,p)g(x,p) be the maximum possible integer pkpk where kk is an integer such that xx is divisible by pkpk. For example:
- g(45,3)=9g(45,3)=9 (4545 is divisible by 32=932=9 but not divisible by 33=2733=27),
- g(63,7)=7g(63,7)=7 (6363 is divisible by 71=771=7 but not divisible by 72=4972=49).
Let f(x,y)f(x,y) be the product of g(y,p)g(y,p) for all pp in prime(x)prime(x). For example:
- f(30,70)=g(70,2)⋅g(70,3)⋅g(70,5)=21⋅30⋅51=10f(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=63f(525,63)=g(63,3)⋅g(63,5)⋅g(63,7)=32⋅50⋅71=63.
You have integers xx and nn. Calculate f(x,1)⋅f(x,2)⋅…⋅f(x,n)mod(109+7)f(x,1)⋅f(x,2)⋅…⋅f(x,n)mod(109+7).
Input
The only line contains integers xx and nn (2≤x≤1092≤x≤109, 1≤n≤10181≤n≤1018) — the numbers used in formula.
Output
Print the answer.
Examples
input
Copy
10 2
output
Copy
2
input
Copy
20190929 1605
output
Copy
363165664
input
Copy
947 987654321987654321
output
Copy
593574252
Note
In the first example, f(10,1)=g(1,2)⋅g(1,5)=1f(10,1)=g(1,2)⋅g(1,5)=1, f(10,2)=g(2,2)⋅g(2,5)=2f(10,2)=g(2,2)⋅g(2,5)=2.
In the second example, actual value of formula is approximately 1.597⋅101711.597⋅10171. Make sure you print the answer modulo (109+7)(109+7).
In the third example, be careful about overflow issue.
OJ题号
链接:https://codeforces.com/contest/1228/problem/C
来源:Codeforces Round #589 (Div. 2)简单题意
对于一个 x ,prime(x) ={p1, p2…, pn},表示x可以整除那些素数.
g(x, p) 表示 x%max(p ^k)==0, max(p^k) = g(x, p) 。
f(x, n) = g(n, p1) × g(n, p2) ×···× g(n,pn),prime(x) ={p1, p2…, pn},p1, p2…, pn表示 x 的质因子。最后求出 f(x, 1) × f(x, 2) × ··· × f(x, n)。
正解思路
f(x,1)*f(x,2)*........f(x,n)=g(1,p1)*g(1,p2)*......g(1,pn)* g(2,p1)*g(2,p2)*........g(2,pn) *.......* g(n,p1)*g(n,p2)*.......g(n,pn)
我们可以发现我们可以忽略最大的p^k条件,对于p1来说,我们求g(1,p1)*g(2,p1)*......*g(n,p1),[1,n]中可以整除p1的贡献一个p1,整除p1^2的又可以贡献一个p1.......
所以,n/p代表[1,n]可以整除p的个数,我们可以cnt=n/p+n/(p1^2)+.....+n/(p^n),p的答案贡献为p^cnt。
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n,x,ans,tot;
const int mod=1e9+7;
LL fac[100];
LL pow_mod(LL a, LL b)
{
int res = 1;
for(; b; b >>= 1)
{
if(b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
void calfac(LL n)
{
for(LL i=2;i*i<=n;i++)
{
if(n%i==0)
{
fac[++tot]=i;
while(n%i==0)
n/=i;
}
}
if(n>1)
fac[++tot]=n;
}
int main()
{
tot=0;
scanf("%lld%lld",&x,&n);
ans=1;
calfac(x);
for(int i=1;i<=tot;i++)
{
LL t=n,cnt=0;
while(t)
{
cnt+=t/fac[i];
t/=fac[i];
}
//cout<<fac[i]<<" "<<cnt<<endl;
ans = (ans * pow_mod(fac[i], cnt)) % mod;
}
cout << ans << endl;
return 0;
}