Codeforces Round #589 (Div. 2) 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
input
10 2
output
2
input
20190929 1605
output
363165664
input
947 987654321987654321
output
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.
题目意思：就是让你求f(x,1)+f(x,2)+…f(x,n), f的求法题目里有
思路：首先是需要对x进行因式分解的，分解成质因数，然后开一个数组记录质因数，然后计算每个质因数的贡献值（应该是这样叫的），比如说 当 n=9时，3对9的贡献值为4,因为从1~n（9）中 3对3贡献值为1，3对6贡献值为1，3对9的贡献值为2，然后用快速幂求一下3的4次方就行，依次类推，就把这个题变成了求快速幂的题

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<vector>
#include<stack>
#include<iostream>
#define ll long long
const int mod=1000000007;
using namespace std;

ll v[10005],s[10005];
ll ksm(ll x,ll y)
{
    ll ans=1;
    while(y)
    {
        if(y&1)
        {
            ans=(ans*x)%mod;
        }
        x=x*x%mod;
        y>>=1;
    }
//    printf("%d ",ans);
    return ans%mod;
}
int main()
{
    ll x,n;
    scanf("%lld%lld",&x,&n);
    int ant=0;
    for(ll i=2;i*i<=x;i++)
    {
        if(x%i==0)
        {
            v[ant++]=i;
            while(!(x%i))
        {
            x=x/i;
        }
        }

    }
    if(x>1)
    {
        v[ant++]=x;
    }
    ll summ=1,ans=1,t,m;
    for(int a=0;a<ant;a++)
    {
        t=0,m=n;
        while(m)
        {

            t+=m/v[a];
            m=m/v[a];
        }
        ans=(ans*ksm(v[a],t))%mod;
    }
    printf("%lld\n",ans);
    return 0;
}