Pagini recente » Cod sursa (job #2286231) | Cod sursa (job #2037194) | Cod sursa (job #2625060) | Cod sursa (job #958293) | Cod sursa (job #2433425)
#include<bits/stdc++.h>
#define MOD 9901
using namespace std;
ifstream fin("sumdiv.in");
ofstream fout("sumdiv.out");
int lgnp(int a,int b)
{
int r=1;
while(b)
{
if((b&1)==1) r=(1LL*r*a)%MOD;
a=1LL*a*a%MOD;
b/=2;
}
return r;
}
int a,b,n,fm,d=2,s=1;
int main()
{
fin>>a>>b;
if(a==0)
{
fout<<0;
return 0;
}
if(a==1)
{
fout<<1;
return 0;
}
if(b==0)
{
fout<<1;
return 0;
}
n=lgnp(a,b);
do
{
fm=0;
while(n%d==0)
{
n/=d;
fm++;
}
if(fm>0)s=(1LL*s*(lgnp(d,fm+1)-1)/(d-1))%MOD;
d++;
if(d*d>n&&n>1)
{
s=(1LL*s*(d*d-1)/(d-1))%MOD;
n=1;
}
}while(n>1);
fout<<s;
return 0;
}