Pagini recente » Cod sursa (job #39386) | Cod sursa (job #1801688) | Cod sursa (job #2835783) | Cod sursa (job #1600415) | Cod sursa (job #3227988)
#include <iostream>
#include <fstream>
using namespace std;
const int M = 1999999973;
long int power(long int n, long int p) //computes n ^ p modulo M
{
if(p == 0)
return 1;
if(p % 2)
return (n * power(n * n, p / 2)) % M;
return power(n * n, p / 2) % M;
}
int main(void)
{
ifstream fin("lgput.in");
ofstream fout("lgput.out");
long int n, p;
fin >> n >> p;
fout << power(n, p) << "\n";
fin.close();
fout.close();
return 0;
}