Pagini recente » Cod sursa (job #2156561) | Cod sursa (job #1992234) | Cod sursa (job #2466052) | Cod sursa (job #677185) | Cod sursa (job #1101491)
#include <fstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <queue>
#include <cmath>
#define mod 1999999973
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
int N, P;
int lgput(int baza, int exp)
{
int res=1;
while (exp)
{
if (exp%2) res=(1LL*res*baza)%mod;
else baza=(1LL*baza*baza)%mod;
exp/=2;
}
return res;
}
int main()
{
f>>N>>P;
g<<lgput(N, P)<<'\n';
return 0;
}