Pagini recente » Cod sursa (job #3153143) | Clasament Teme ACM Unibuc 2013 | Cod sursa (job #1093719) | Cod sursa (job #1229750) | Cod sursa (job #932810)
Cod sursa(job #932810)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long nr,put,m=1999999973;
long long Solve(long long n,long long p)
{ int bit=0; long long sol=1;
while((1<<bit)<=p)
{ if (p&(1<<bit)) sol=((long long) sol*n)%m;
n=((long long) n*n)%m;
bit++;
}
return (long long) sol;
}
int main()
{ f>>nr>>put;
g<<(long long)Solve(nr,put);
return 0;
}