Pagini recente » Cod sursa (job #809499) | Cod sursa (job #2177609) | Istoria paginii runda/absenta | Cod sursa (job #2233810) | Cod sursa (job #1226491)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD = 1999999973;
int putere(int N, int p)
{
if(p==0)
return 1;
if(p%2==0)
{
int v=putere(N,p/2);
return ((long long)v*(long long)v)%MOD;
}
else
{
return ((long long)N*(long long)putere(N,p-1))%MOD;
}
}
int main()
{
int N, P;
ifstream fin("lgput.in");
fin>>N>>P;
ofstream fout("lgput.out");
fout<<putere(N,P);
fin.close();
fout.close();
return 0;
}