Pagini recente » Cod sursa (job #2629725) | Cod sursa (job #2347497) | Cod sursa (job #2660423) | Cod sursa (job #2666886) | Cod sursa (job #2666687)
#include <iostream>
#include <fstream>
using namespace std;
#define debug_var(x) cout << #x << '=' << x << endl;
#define debug_stl(x) for(auto k : x) cout << k << ' '; cout << endl;
#define debug_map(x) for(auto k : x) cout << k.first << ':' << k.second << endl;
#define read_vector(x, s, k) for(auto i = s; i <= k; ++i) cin >> x[i];
#define read_2dvector(x, s, l1, l2) for(auto i = s; i <= l1; ++i) for(auto j = s; j <= l2; ++j) cin >> x[i][j];
#define vec vector
#define ull unsigned long long int
#define ll long long int
#define str string
#define umap unordered_map
#define uset unordered_set
#define mset multiset
#define umset unordered_multiset
#define MOD 1999999973
ull n, m;
ull multiply(ull a, ull b) {
ull result = 0;
while(b) {
if(b & 1) {
result += a;
if(result >= MOD) result -= MOD;
}
a += a;
if(a >= MOD) a -= MOD;
b >>= 1;
}
return result;
}
ull power(ull b, ull e) {
ull result = 1;
while(e) {
if(e & 1) result = multiply(result, b);
b = multiply(b, b);
e >>= 1;
}
return result;
}
int main() {
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> m;
cout << power(n, m);
return 0;
}