Pagini recente » Cod sursa (job #1048310) | Cod sursa (job #2311094) | Diferente pentru problema/cub intre reviziile 32 si 33 | Cod sursa (job #674180) | Cod sursa (job #1745676)
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
signed long long int myPow(signed long long int n, signed long long int p) {
if (p == 0)
return 1;
else if (p == 1)
return n;
else if (p % 2 == 0)
return myPow((n * n) % 1999999973, p / 2);
else return (n * myPow((n * n) % 1999999973, (p - 1) / 2)) % 1999999973;
}
int main() {
signed long long int p, n, aux = 1999999973;
fin >> n >> p;
fout << (signed long long int)(myPow(n, p) % aux);
return 0;
}