Pagini recente » Cod sursa (job #2292834) | Cod sursa (job #2553696) | Cod sursa (job #3277150) | Cod sursa (job #2544909) | Cod sursa (job #2178179)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1999999973
ll a, b;
/*ll lgput(ll x, ll y){
if (y == 1) return x%MOD;
if (y & 1) return ((x%MOD) * lgput((x*x)%MOD, y/2))%MOD;
else return lgput((x*x)%MOD, y/2)%MOD;
}*/
unsigned long long lgput(unsigned int n,unsigned int p){
if (p==1) return n;
else if (p%2==0) {i=lgput(n,p/2)%1999999973; return i*i%1999999973;}
else if (p%2==1) {i=lgput(n,p/2)%1999999973; return i*i*n%1999999973;}
int main(){
ifstream cin ("lgput.in");
ofstream cout ("lgput.out");
cin >> a >> b;
cout << lgput(a, b);
return 0;
}