Pagini recente » Cod sursa (job #2629364) | Cod sursa (job #2215578) | Cod sursa (job #2660646) | Rating InfoOlimpiku (InfoOlimpiku) | Cod sursa (job #2504926)
#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 = (r * n) % mod;
n = (n * n) % mod;
p /= 2;
}
return r;
}
int main()
{
fin >> n >> p;
fout << ridput(n, p);
return 0;
}