Pagini recente » Cod sursa (job #1876169) | Cod sursa (job #2087274) | Cod sursa (job #1605424) | Cod sursa (job #1776127) | Cod sursa (job #2500387)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int mod = 1999999973;
long long n, p;
int ridput(int n, int p)
{
int r = 1;
while(p){
if(p % 2 == 1)
r = (1LL * r * n) % mod;
n = (1LL * n * n) % mod;
p /= 2;
}
return r;
}
int main()
{
fin >> n >> p;
fout << ridput(n, p);
return 0;
}