Pagini recente » Cod sursa (job #2804394) | Cod sursa (job #2478257) | Cod sursa (job #88781) | Cod sursa (job #143972) | Cod sursa (job #3260077)
#include <fstream>
using namespace std;
const int MOD = 1999999973;
int main()
{
ifstream in("lgput.in");
ofstream out("lgput.out");
int a, n, p = 1;
in >> a >> n;
while (n != 0)
{
int cifb = n % 2;
if (cifb != 0)///cifra binara curenta e nenula
{
p = ((long long)p * a) % MOD;
}
a = ((long long)a * a) % MOD;
n /= 2;
}
out << p;
in.close();
out.close();
return 0;
}