Pagini recente » Cod sursa (job #1543072) | Cod sursa (job #469554) | Cod sursa (job #2130641) | Cod sursa (job #1836979) | Cod sursa (job #1054288)
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
#define mod 1999999973
long long int n,p;
int power(long long int x)
{
if(x==1)
return n%mod;
else
if(x%2==1)
return ((long long int) (pow(power(x/2)*n%mod,2)))%mod;
else
return ((long long int) pow(power(x/2),2))%mod;
}
int main()
{
f>>n>>p;
g<<power(p);
f.close();g.close();
return 0;
}