Pagini recente » Cod sursa (job #2393566) | Cod sursa (job #1755064) | Cod sursa (job #890774) | Cod sursa (job #1163313) | Cod sursa (job #2673344)
#include <iostream>
#include <fstream>
using namespace std;
// Sandro's Biography
long long Putere(long long n, long long i) {
if (i < 0) return Putere(1 / n, -i);
else if (i == 0) return 1;
else if (i == 1) return n ;
else if (i % 2) return n * Putere(n * n % 1999999973, i / 2);
else return Putere(n * n % 1999999973, i / 2);
}
int main() {
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
long long n, m;
scanf("%d %d", &n, &m);
long long sol = Putere(n, m);
printf("%lld\n", sol % 1999999973); // Afisam solutia
}