Pagini recente » Cod sursa (job #3292417) | Cod sursa (job #2706678) | Cod sursa (job #2947828) | Cod sursa (job #2373329) | Cod sursa (job #2758562)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const long long mod = 1999999973;
long long pow(long long N, long long P){
if(P == 0)
return 1;
else if(P % 2)
return N * pow(N, P - 1) % mod;
return pow(N, P / 2) * pow(N, P / 2) % mod;
}
int main()
{
ifstream cin("lgput.in");
ofstream cout("lgput.out");
long long N, P;
cin >> N >> P;
cout << pow(N, P);
cin.close();
cout.close();
return 0;
}