Pagini recente » Diferente pentru problema/order2 intre reviziile 19 si 20 | Cod sursa (job #1520977) | Monitorul de evaluare | Cod sursa (job #2051421) | Cod sursa (job #1871520)
#include <stdio.h>
#define mod 1999999973
using namespace std;
long long int n, p, sol;
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
scanf("%lld %lld", &n, &p);
sol = 1;
while (p > 0) {
if (p % 2 == 1) sol = (1LL * sol * n) % mod;
n = (1LL * n * n) % mod; p = p / 2;
}
printf("%lld", sol);
return 0;
}