Cod sursa(job #2141301)
Utilizator | Data | 24 februarie 2018 11:46:28 | |
---|---|---|---|
Problema | Suma divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <bits/stdc++.h>
#define MOD 9901
using namespace std;
ifstream fin("sumdiv.in");
ofstream fout("sumdiv.out");
int p,e;
int Lgput(int a,int n)
{
int p=1;
while(n)
{
if(n%2)p=1LL*p*a%MOD;
a=1LL*a*a%MOD;
n/=2;
}
return p;
}
int main()
{
fin>>p>>e;
fout<<(1LL*(Lgput(p,e+1)-1)%MOD*Lgput(p-1,MOD-2)%MOD)%MOD;
return 0;
}