Pagini recente » Cod sursa (job #1443303) | Cod sursa (job #2884394) | Cod sursa (job #577676) | Cod sursa (job #577692) | Cod sursa (job #1645788)
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#define NMax 10
#define mod 1999999973
#define INF 0x3f3f3f3f
using namespace std;
long long n,p;
long long power(long long x,long long p){
long long r = 1;
while(p != 0){
if(p % 2 == 1){
p--;
r = (r * (x % mod)) % mod;
}
x = (x * (x % mod) % mod);
p /= 2;
}
return r % mod;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld%lld",&n,&p);
printf("%lld\n",power(n % mod,p));
return 0;
}