Pagini recente » Cod sursa (job #1523950) | Cod sursa (job #3272331) | Cod sursa (job #130038) | Cod sursa (job #181283) | Cod sursa (job #3161333)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD = 9901;
ifstream f("sumdiv.in");
ofstream g("sumdiv.out");
int powlg(int x, int p)
{
int sol = 1, a = x % MOD;
while(p)
{
if(p & 1)
sol = sol * a % MOD;
a = a * a % MOD;
p >>= 1;
}
return sol;
}
inline int InvMod(int x)
{
return powlg(x, MOD - 2);
}
int sFact(int d, int ex)
{
int x = d % MOD;
if(x == 0)
return 1;
if(x == 1)
return (ex + 1) % MOD;
return (powlg(d, ex + 1) + MOD - 1) * InvMod(d - 1) % MOD;
}
int main()
{
int A, B, S = 1, p;
f >> A >> B;
for(int d = 2; d * d <= A; d++)
if(A % d == 0)
{
p = 0;
do
{
p++;
A /= d;
}
while(A % d == 0);
S = S * sFact(d, B * p) % MOD;
}
if(A > 1)
S = S * sFact(A, B) % MOD;
g << S;
f.close();
g.close();
return 0;
}