Pagini recente » Cod sursa (job #2622976) | Borderou de evaluare (job #2191984) | Cod sursa (job #649168) | Cod sursa (job #1333141) | Cod sursa (job #1609254)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long n,p;
long long functie( long long n, long long p, long long mod)
{
int x=1;
while(p)
{
if(p%2==1)
{
x=(x*n)%mod;
p--;
}
else
{
n=(n*n)%mod;
p=p/2;
}
}
return x;
}
int main()
{
f>>n>>p;
g<<functie(n,p,1999999973);
return 0;
}