Cod sursa(job #582844)
Utilizator | Data | 16 aprilie 2011 09:25:07 | |
---|---|---|---|
Problema | Suma divizorilor | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream.h>
#define mod 9901
ifstream f("sumdiv.in");
ofstream g("sumdiv.out");
long long int a,b,i,s=0;
long long int putere( long long int a,long long int b)
{
if(b==1)
return a%mod;
else
if(b%2==0)
{
long long int x=putere(a,b/2);
return x*x%mod;
}
else
return a*putere(a,b-1)%mod;
}
int main()
{
f>>a>>b;
for(i=1;i<=putere(a,b);i++)
if(putere(a,b)%i==0)
s+=i%mod;
g<<s<<'\n';
f.close();
g.close();
return 0;
}