Pagini recente » Cod sursa (job #1884641) | Cod sursa (job #1812931) | Cod sursa (job #2536730) | Cod sursa (job #538072) | Cod sursa (job #2775166)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forr(X) for(int i = 0; i<X; i++)
#pragma GCC optimize("Ofast")
const int mod = 1999999973;
const int in = INT_MAX;
#define int ll
#define out(X) for(auto it: X){ for(auto ito : it)cout<<ito<<" "; cout<<endl;}
int32_t main(){
freopen("lgput.out", "w", stdout);
freopen("lgput.in", "r", stdin);
int x, n; cin>>x>>n;
vector<bool> nbin;
while(n>0){
nbin.pb(n%2);
n/=2;
}
reverse(nbin.begin(), nbin.end());
int res = 1;
for(int i=0; i<nbin.size(); i++){
res=(res*res)%mod;
if(nbin[i]==1)res=(res*x)%mod;
}
cout<<res;
}