Pagini recente » Cod sursa (job #2581577) | Cod sursa (job #459338) | Cod sursa (job #568698) | Cod sursa (job #3182453) | Cod sursa (job #997821)
Cod sursa(job #997821)
#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>
using namespace std;
const string file = "lgput";
const string infile = file + ".in";
const string outfile = file + ".out";
const int INF = 0x3f3f3f3f;
const int MODN = 1999999973;
unsigned ModPow(unsigned N, unsigned P)
{
unsigned long long C = N;
unsigned long long R = 1;
for(unsigned i = 0; i < 32; i++)
{
if( P & (1 << i))
{
R *= C;
R %= MODN;
}
C *= C;
C %= MODN;
}
return (unsigned) R;
}
int main()
{
fstream fin(infile.c_str(), ios::in);
unsigned N;
unsigned P;
fin >> N >> P;
fin.close();
fstream fout(outfile.c_str(), ios::out);
fout << ModPow(N, P) << "\n";;
fout.close();
}