Pagini recente » Cod sursa (job #122565) | Cod sursa (job #2556774) | Cod sursa (job #2036398) | Cod sursa (job #3216735) | Cod sursa (job #2590636)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long MOD=1999999973;
long long int ridicare_in_timp_logaritmic(long long int N, long long int P, long long int R)
{
if(P==0)
return R;
if(P%2==1)
ridicare_in_timp_logaritmic(N*N%MOD, P/2, R*N%MOD);
else
ridicare_in_timp_logaritmic(N*N%MOD, P/2, R);
}
int main()
{
ifstream f("lgput.in");
ofstream g("lgput.out");
long long N, P, R=1;
f>>N>>P;
long long int solutie=ridicare_in_timp_logaritmic(N, P, R);
g<<solutie;
return 0;
}