Pagini recente » Cod sursa (job #530092) | Cod sursa (job #85560) | Cod sursa (job #1179158) | Cod sursa (job #1210229) | Cod sursa (job #992947)
Cod sursa(job #992947)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
//#include <cmath>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
#define baza 1
#define MAX 100005
#define MOD 1999999973
long long int n,b,nr,i,j, p;
long long int x,m,maxx;
long long int pow(long long int a,long long int b)
{
long long p=1;
while(b)
{
if((b&1)==1)
{
p*=a;
p%=MOD;
}
a*=a;
a%=MOD;
b>>=1;
}
return p;
}
int main()
{
fin>>n>>p;
n%=MOD;
fout<<pow(n,p);
return 0;
}