Pagini recente » Borderou de evaluare (job #723727) | Cod sursa (job #410588) | Cod sursa (job #2669530) | Diferente pentru problema/jetoane2 intre reviziile 17 si 24 | Cod sursa (job #2088621)
#include<bits/stdc++.h>
#define m 1999999973
#define ll unsigned long long
using namespace std;
ll n,p,rs;
ll pow(ll n, ll p) {
if (p==1) return n%m;
if (p==0) return 1;
long long t = pow(n,p/2)%m;
return ((t*t)%m*pow(n,p%2))%m;
}
int main() {
ifstream cin("lgput.in");
ofstream cout("lgput.out");
cin>>n>>p;
cout<<pow(n,p)%m;
return 0;
}