Pagini recente » Cod sursa (job #2006670) | Cod sursa (job #506790) | Cod sursa (job #388900) | Cod sursa (job #227585) | Cod sursa (job #2272964)
#include <fstream>
using namespace std;
ifstream in("sumdiv.in");
ofstream out("sumdiv.out");
const long long MOD=9901;
long long a,b;
long long lgput(long long n,long long k)
{
long long rez=1;
while(k)
{
if(k%2)
rez=(long long)(rez*n)%MOD;
n=(long long)(n*n)%MOD;
k/=2;
}
return rez%MOD;
}
void desc()
{
long long d=2,rezfin=1,cnt=0;
while(d*d<=a)
{
cnt=0;
while(a%d==0)
{
a/=d;
cnt++;
}
rezfin=(long long)(rezfin*(lgput(d,cnt*b+1)-1)*lgput(d-1,MOD-1))%MOD;
d++;
}
if(a!=1)
rezfin=(long long)(rezfin*(lgput(a,b+1)-1)*lgput(a-1,MOD-1))%MOD;
out<<rezfin;
}
int main()
{
in>>a>>b;
desc();
return 0;
}