Pagini recente » Cod sursa (job #2403800) | Cod sursa (job #2038261) | Cod sursa (job #2801152) | Cod sursa (job #720938) | Cod sursa (job #3254880)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin ("lgput.in");
ofstream fout ("lgput.out");
const ll MOD = 1999999973;
int main()
{
fin.tie(0); fin.sync_with_stdio(false);
ll x, y; fin>>x>>y;
ll p=1;
//1 0 0
while (y!=0) {
if (y%2==1) p=(p*x)%MOD;
x=(x*x)%MOD;
y/=2;
// cout<<x<<' '<<y<<' '<<p<<endl;
}
fout<<p;
return 0;
}
/*
N*N*N*...*N de P ori
(a+b)%MOD = ( (a%MOD) + (b%MOD) ) % MOD
(a+b+c)%MOD = ( [ ( (a%MOD) + (b%MOD) ) % MOD ] +( c % MOD ) )% MOD
(a-b)%MOD = ( (a%MOD) - (b % MOD) ) % MOD
*/