Pagini recente » Borderou de evaluare (job #2738278) | Rezultatele filtrării | Borderou de evaluare (job #3196551) | Borderou de evaluare (job #1062372) | Cod sursa (job #1508232)
#include <iostream>
#include <fstream>
using namespace std;
const int mod = 1999999973;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int pow(int n, int p)
{
if(p == 0)
return 1;
if(p == 1)
return n;
int y = pow(n,p/2)%mod;
if(p%2)
return (y*y*n)%mod;
else
return (y*y)%mod;
}
int main()
{
int n,p;
fin>>n>>p;
fout<<pow(n,p);
return 0;
}