Pagini recente » Cod sursa (job #2339151) | Cod sursa (job #367274) | Cod sursa (job #1783123) | Cod sursa (job #2922822) | Cod sursa (job #1851157)
#include <fstream>
#include <iostream>
using namespace std;
long long modulo(long long n)
{
n %= 1999999973;
return n;
}
long long exponentiere(long long n, long long p)
{
if(p == 1)
return n;
if(p % 2 == 1)
return modulo(n * exponentiere(n, p-1));
else
return modulo(exponentiere(modulo(n*n), p/2));
}
int main()
{
long long n, p, k;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
fin >> n >> p;
n = exponentiere(n, p);
fout << n;
return 0;
}