Pagini recente » Profil Vlad_Bujoreanu | Cod sursa (job #2402992) | Cod sursa (job #1587732) | Cod sursa (job #1796161) | Cod sursa (job #2141034)
#include <bits/stdc++.h>
using namespace std;
const int MOD = 9901;
ifstream in("sumdiv.in");
ofstream out("sumdiv.out");
int lgput(int b, int p)
{
int r = 1;
while(p)
{
if(p & 1)
r = r * b % MOD;
b = b * b % MOD;
p >>= 1;
}
return r;
}
int geom(int b, int p)
{
if( p == 0 ) return 1;
if( p == 1 ) return (b + 1) % MOD;
if( p % 2 == 1 ) {
return (1 + lgput(b, p/2 + 1)) * geom(b, p / 2) % MOD;
}
else {
return (1 + 1LL * b * (1 + lgput(b, p/2)) * geom(b, p/2));
}
}
int main()
{
int a, b;
in >> a >> b;
if( a + b == 0 ) {
out << "0\n";
return 0;
}
if( b == 0 ) {
out << "1\n";
return 0;
}
if( a == 0 ) {
out << "0\n";
return 0;
}
/* if( a == 1 ) {
out << b + 1 << '\n';
return 0;
}*/
int r = 1;
for( int ind = 2; ind * ind <= a; ++ind ) {
if( a % ind == 0 ) {
int cnt = 0;
while(a % ind == 0) {
++cnt;
a /= ind;
}
r = r * geom(ind, cnt * b) % MOD;
}
}
if( a > 1 )
r = r * geom(a, 1 * b) % MOD;
out << r << '\n';
return 0;
}