Pagini recente » Cod sursa (job #1137372) | Cod sursa (job #24875) | Cod sursa (job #1352884) | Cod sursa (job #2392439) | Cod sursa (job #1768510)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int MOD = 1999999973;
unsigned int n, p;//n ^ p
int put[33];
//put[i] = n ^ (2 ^ i)
int main() {
fin >> n >> p;
put[0] = n % MOD;
for(int i = 1; i <= 32; ++i)
put[i] = 1ll * put[i - 1] * put[i - 1] % MOD;
int ans = 1;
for(int i = 0 ; i <= 32; ++i)
if(p & (1 << i)) {
ans = 1ll * ans * put[i] % MOD;
}
fout << ans << '\n';
return 0;
}