Pagini recente » Cod sursa (job #1132456) | Monitorul de evaluare | Cod sursa (job #1576789) | Infoarena Monthly 2012 - Runda 4, Probleme | Cod sursa (job #2022307)
#include<bits/stdc++.h>
using namespace std;
const long long prim=1999999973;
ifstream in("lgput.in");
ofstream out("lgput.out");
long long n,p;
long long put(long long x,long long n)
{if(x<=1)return x;
if(n==0)return 1;
if(n==1)return x;
if(n%2==0)return put((x*x)%prim,n/2);
else return x*put((x*x)%prim,(n-1)/2);
}
int main(){
in>>n>>p;
out<<put(n,p);
in.close();
out.close();
return 0;}