Pagini recente » Cod sursa (job #1107124) | Cod sursa (job #2753716) | Cod sursa (job #2519589) | Cod sursa (job #2250741) | Cod sursa (job #1326920)
#include <iostream>
#include <fstream>
#define MOD 1999999973
using namespace std;
long long n,p,x;
ifstream f("lgput.in");
ofstream g("lgput.out");
int putere(long long n, long long p)
{
if (p<0) return putere(1/n, p*(-1));
if (p==0) return 1;
if (p==1) return n%MOD;
if (p%2==0) return (putere(n*n%MOD, p/2))%MOD;
if (p%2==1) return (n*putere(n*n%MOD, p/2))%MOD;
}
int main()
{
f>>n>>p;
putere(n,p);
g<<putere(n,p);
return 0;
}