Pagini recente » Cod sursa (job #2555139) | Cod sursa (job #1275045) | Cod sursa (job #2727325) | Cod sursa (job #1113187) | Cod sursa (job #1503925)
#include <iostream>
#include <fstream>
using namespace std;
long mod = 1999999973;
int putere(int n,int p)
{
if(p==1)
{
return n%mod;
}
else if(p==2)
{
return n*n%mod;
}
else if(p%2==0)
{
return putere(n*n,p/2)%mod;
}
else if(p%2==1)
{
return n*putere(n*n,p/2)%mod;
}
}
int main()
{
ifstream fin ("lgput.in");
ofstream fout ("lgput.out");
long n,p;
fin>>n>>p;
fout<<putere(n,p);
return 0;
}