Cod sursa(job #330873)
| Utilizator | Data | 11 iulie 2009 20:55:14 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include "fstream"
std::ifstream in("sumdiv.in");
std::ofstream out("sumdiv.out");
const int m=1;
long long putere(long long n, long long p)
{
if(p==0)
return 1;
if(p%2)
return (n*putere(n*n%m,p/2))%m;
return putere(n*n%m,p/2);
}
int main ()
{
long long S,a,b,pow;
in>>a>>b;
pow=putere(a,b);
S=(pow-a)/(b-1);
out<<S%9901;
out<<"\n";
in.close ();
out.close ();
return 0;
}
