Pagini recente » Cod sursa (job #2768559) | Monitorul de evaluare | Cod sursa (job #1705858) | Cod sursa (job #995819) | Cod sursa (job #2043533)
#include <iostream>
#include <fstream>
#include <climits>
//#define mod 1999999973
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long int mod=1999999973;
long long int puterelg(long long int x, int n)
{
long long int p = 1 ;
while (n > 0)
{
if (n%2==1)
{
p=p* x%mod;
n-- ;
}
x=x * x;
x=x %mod;
n=n / 2;
}
return p ;
}
int main()
{
long long int N,P;
f>>N>>P;
g<<puterelg(N,P);
f.close();
g.close();
}