Pagini recente » Cod sursa (job #1689672) | Cod sursa (job #2838517) | Cod sursa (job #1648435) | Cod sursa (job #2318038) | Cod sursa (job #2940273)
#include <fstream>
using namespace std;
const int MOD = 1999999973;
int putere(int a, int n)
{
int p = 1;
while (n != 0)
{
if (n % 2 != 0)//(n & 1) != 0
{
p = (long long)p * a % MOD;
}
a = (long long)a * a;
n /= 2;// n <<= 1
}
return p;
}
int main()
{
ifstream in("lgput.in");
ofstream out("lgput.out");
int a, n;
in >> a >> n;
out << putere(a, n);
in.close();
out.close();
return 0;
}