Pagini recente » Cod sursa (job #641698) | Cod sursa (job #2870921) | Cod sursa (job #1084057) | Cod sursa (job #12189) | Cod sursa (job #2041490)
#include <iostream>
#include <fstream>
using namespace std;
const int mod = 1999999973;
long long int putere(long long int a, long long int n)
{
long long int p = 1;
a %= mod;
while(n > 0)
{
if(n % 2 == 0)
{
n /= 2;
a *= a;
a %= mod;
}
else
{
n--;
p *= a;
p %= mod;
}
}
return p;
}
int main()
{
long long int a, n;
ifstream f("lgput.in");
ofstream g("lgput.out");
f >> a >> n;
g<<putere(a, n);
return 0;
}