Pagini recente » Cod sursa (job #1627380) | Cod sursa (job #2404801) | Cod sursa (job #1543982) | Cod sursa (job #330623) | Cod sursa (job #796917)
Cod sursa(job #796917)
#include <fstream>
#include <string>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#define infile "lgput.in"
#define outfile "lgput.out"
#define n_max
#define INF 1 << 30
#define MOD 1999999973
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mkp make_pair
#define pii pair<int, int>
#define FOR(g) \
for(vector<int>::iterator it=g.begin(); it!=g.end(); ++it)
#define nxt (*it)
#define min(x,y) x<y ? x : y
#define max(x,y) x>y ? x : y
using namespace std;
ull N, P;
void read(){
ifstream fin(infile);
fin >> N >> P;
fin.close();
}
ull powlog(ull N, ull P){
if(P == 1)
return N % MOD;
ull res = powlog(N, P/2);
res = (res * res) % MOD;
if(P&1)
res = (res * N) % MOD;
return res;
}
void print(){
ofstream fout(outfile);
fout << powlog(N, P);
fout.close();
}
int main(){
read();
print();
return 0;
}