Pagini recente » Cod sursa (job #3186878) | Cod sursa (job #1845638) | Cod sursa (job #3187024) | Diferente pentru problema/pmk intre reviziile 36 si 33 | Cod sursa (job #1188230)
#include <fstream>
using namespace std;
const unsigned long long mod=1999999973;
unsigned long long n, p;
ifstream f("lgput.in");
ofstream g("lgput.out");
unsigned long long Exp(int p)
{
if (p!=1) {
long long rez;
rez=Exp(p/2)%mod;
rez=(rez*rez)%mod;
if (p%2)
rez*=n;
return rez%mod;
}
else
return n;
}
int main()
{
f>>n>>p;
g<<Exp(p);
return 0;
}