Pagini recente » Clasament lol1 | Clasamentul arhivei de probleme | Cod sursa (job #1841991) | Clasamentul arhivei de probleme | Cod sursa (job #2943709)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
int M = 1999999973;
int putere(int a, int n)
{
int p = 1;
while (n != 0)
{
int cif = n % 2;
if (cif != 0)
{
p = (long long)p * a % M;
}
a = (long long)a * a % M;
n /= 2;
}
return p;
}
int main()
{
int N, P;
in >> N >> P;
out << putere(N, P) << endl;
return 0;
}