Pagini recente » Cod sursa (job #946317) | Borderou de evaluare (job #1376347) | Cod sursa (job #1138768)
#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;
//#define ONLINE_JUDGE
long long powMod(long long A, long long B, long long MODN)
{
long long res = 1;
long long c = A;
for(int i = 0; i <32; i++)
{
if((1<<i) & B)
{
res *= c;
res %= MODN;
}
c *= c;
c %= MODN;
}
return res;
}
const long long MODN = 1999999973;
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 A, B;
fin >> A >> B;
fout << powMod(A, B, MODN) << "\n";
#ifdef ONLINE_JUDGE
#else
fout.close();
fin.close();
#endif
}