Pagini recente » Cod sursa (job #1229517) | Cod sursa (job #2221376) | Cod sursa (job #315926) | Cod sursa (job #544592) | Cod sursa (job #2590535)
#include <iostream>
#include <fstream>
using namespace std;
const int mod = 1999999973;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
long long putere(long long n, long long p)
{
// 00101001
// 1000
long long sol = 1;
long long baza = n;
long long exponent = 1;
while(exponent <= p)
{
// apare exponent in descompunerea binara a puterii
if(p & exponent)
{
sol *= baza;
sol %= mod;
}
baza = baza * baza;
exponent *= 2;
}
return sol;
}
int main()
{
long long n, p;
fin >> n >> p;
fout << putere(n, p);
return 0;
}