Pagini recente » Cod sursa (job #1045933) | Cod sursa (job #907875) | Cod sursa (job #1448034) | Cod sursa (job #1045945) | Cod sursa (job #2716982)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
const int mod = 1999999973;
long long n, p;
long long putere() {
long long rez = 1;
while(p) {
if(p % 2)
rez = ((rez % mod) * (n % mod)) % mod;
n = ((n % mod) * (n % mod)) % mod;
p /= 2;
}
return rez;
}
int main()
{
f >> n >> p;
g << putere();
return 0;
}