Pagini recente » Cod sursa (job #726371) | Cod sursa (job #2327561) | Cod sursa (job #492976) | Cod sursa (job #1709722) | Cod sursa (job #1606348)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int mod;
long long Calc(long long n, long long p)
{
/*if(p==0)
return 1;
if(p==1)
return n%mod;
if(p%2==1)
return ((n%mod)*(Calc(n-1, p)%mod))%mod;
if(p%2==0)
{
long long v;
v=Calc(n, p/2)%mod;
return (v*v)%mod;
}
*/
if(p==1)
return n;
else if(p%2==0)
return Calc((n*n)%mod, p/2)%mod;
else return (n*Calc((n*n)%mod, p/2))%mod;
}
int main()
{
mod=1999999973;
int n, p;
fin>>n>>p;
fout<<Calc(n, p);
fin.close();
fout.close();
return 0;
}