Pagini recente » Profil OtiliaTurcanu1 | Istoria paginii utilizator/nouseforaname | Istoria paginii utilizator/emilian_tabara | Profil BBchang | Cod sursa (job #1016656)
#include <fstream>
#define X 9901
using namespace std;
ifstream f("sumdiv.in");
ofstream g("sumdiv.out");
int A,B;
long long S;
long long Putere(long long N,long long P)
{
long long m=1;
while (P!=1)
if(P % 2==0)
{
N=(N*N) % X;
P/=2;
}
else
{
m=(m*N) % X;
P--;
}
return (m*N)% X;
}
int main()
{
f>>A>>B;
if(A % 2==0)
{
int k=0;
while(A % 2==0)A/=2,++k;
int p1=(Putere(2,k*B+1)-1)% X;
S=(1LL*S*p1 % X);
}
for(int i=3;i*i<=A;i+=2)
if(A % i==0)
{
int k=0;
while(A % i==0)A/=i,++k;
int p1=(Putere(i,k*B+1)-1)% X;
int p2=Putere(i-1,X-2);
S=(((1LL*S*p1) % X)*p2)% X;
}
if(A>1)
{
int p1=(Putere(A,B+1)-1)% X;
int p2=Putere(A-1,X-2);
S=(((1LL*S*p1) % X)*p2)% X;
}
g<<S<<'\n';
f.close();g.close();
return 0;
}