Pagini recente » Cod sursa (job #364898) | Cod sursa (job #1552147) | Cod sursa (job #341818) | Clasament monthly1 | Cod sursa (job #1136068)
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;
const string file = "lgput";
const string infile = file + ".in";
const string outfile = file + ".out";
const int INF = 0x3f3f3f3f;
const long long MODN = 1999999973;
//#define ONLINE_JUDGE
long long powMod(long long A, long long B, long long MODN)
{
long long result = 1;
long long c = A;
for(int i = 0; i < 32; i++)
{
if( ( 1 << i) & B )
{
result *= c;
result %= MODN;
}
c *= c;
c %= MODN;
}
return result;
}
int main()
{
#ifdef ONLINE_JUDGE
ostream &fout = cout;
istream &fin = cin;
#else
fstream fin(infile.c_str(), ios::in);
fstream fout(outfile.c_str(), ios::out);
#endif
long long N, P;
fin >> N >> P;
fout << powMod(N, P, MODN);
#ifdef ONLINE_JUDGE
#else
fout.close();
fin.close();
#endif
}