Pagini recente » Cod sursa (job #2904720) | Cod sursa (job #265025) | Cod sursa (job #999447) | Cod sursa (job #2544982) | Cod sursa (job #2969806)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
ll m = 1999999973;
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
void solve(){
ll a, b;
cin >> a >> b;
cout << binpow(a, b, m) << '\n';
}
int main(){
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
ios::sync_with_stdio(0); cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
}