Cod sursa(job #694394)
| Utilizator | Data | 27 februarie 2012 20:52:02 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long n,p,ni;
int main()
{
f>>n>>p;
ni=n;
while(p!=1)
{
if(p%2)
p/=2,n=n*n*ni;
else
p/=2,n=n*n;
n=n%1999999973;
}
g<<n%1999999973<<'\n';
f.close();
g.close();
return 0;
}
