Pagini recente » Cod sursa (job #2828103) | Istoria paginii runda/pre002/clasament | Cod sursa (job #1446933) | Cod sursa (job #2321150) | Cod sursa (job #1100973)
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
#define mod 1999999973
typedef long long int lli;
lli n,p;
int power(long long int x)
{
if(x==1)
return n%mod;
else
if(x%2==1)
return n*(lli)pow(power(x/2),2)%mod;
else
return (lli)pow(power(x/2),2)%mod;
}
int main()
{
f>>n>>p;
g<<power(p)%mod;
f.close();g.close();
return 0;
}