Mai intai trebuie sa te autentifici.
Cod sursa(job #2433377)
| Utilizator | Data | 27 iunie 2019 09:35:06 | |
|---|---|---|---|
| Problema | Suma divizorilor | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.79 kb |
#include<fstream>
#define MOD 9901
using namespace std;
ifstream fin("sumdiv.in");
ofstream fout("sumdiv.out");
unsigned long long lgnp(int a,int b)
{
unsigned long long r=1;
while(b)
{
if((b&1)==1) r=(1LL*r*a)%MOD;
a=1LL*a*a%MOD;
b/=2;
}
return r;
}
int a,b,n,fm,d=2;
unsigned long long s=1;
int main()
{
fin>>a>>b;
n=lgnp(a,b);
do
{
fm=0;
while(n%d==0)
{
n/=d;
fm++;
}
if(fm>0)
{
s=1LL*s*(lgnp(d,fm+1)-1)/(d-1);
s=s%MOD;
}
d++;
if(d*d>n&&n>1)
{
s=1LL*s*(d*d-1)/(d-1);
s=s%MOD;
n=1;
}
}while(n>1);
fout<<s;
return 0;
}
