Pagini recente » Cod sursa (job #187528) | Cod sursa (job #1797528) | Rating Cosmin Potoaca (cosm21) | Cod sursa (job #554162) | Cod sursa (job #1909724)
#include <fstream>
using namespace std;
ifstream in("sumdiv.in");
ofstream out("sumdiv.out");
const int MOD=9901;
int a,b;
int ans=1;
int pow(int a,int b)
{
int a1=a,ans;
for(ans=1; b; b>>=1)
{
if(b&1)
ans=(ans*a1)%MOD;
a1=(a1*a1)%MOD;
}
return ans;
}
int main()
{
int p;
in>>a>>b;
for(int i=2; i*i<=a; i++)
{
p=0;
while(a%i==0)
{
p++;
a/=i;
}
p*=b;
if(p) ans*=((pow(i,p+1)-1)/(i-1));
ans%=MOD;
}
if(a>1)
{
p=b;
ans*=((pow(a,p+1)-1)/(a-1));
ans%=MOD;
}
out<<ans%MOD;
return 0;
}