Pagini recente » Cod sursa (job #1803248) | Cod sursa (job #125405) | Cod sursa (job #2462634) | Istoria paginii problema/tetris3 | Cod sursa (job #1284912)
#include<fstream>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
long long n,p;
long long put(long long n,long long p)
{
if(!p)return 1%1999999973;
if(p==1)return n%1999999973;
if(n%2==0)return put(n*n,p/2)%1999999973;
if(n%2!=0)return n*put(n,p-1)%1999999973;
n%=199999973;
}
int main(void)
{
cin>>n>>p;
cout<<put(n,p);
}