Pagini recente » Cod sursa (job #1776321) | Cod sursa (job #2153695) | Cod sursa (job #2111666) | Cod sursa (job #1950179) | Cod sursa (job #1290129)
#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
const ll mod = 1999999973LL;
ll a, b;
ll lgpow(ll a, ll b)
{
ll r = 1;
for(ll i = 1; i <= b; i <<= 1)
{
if(i & b) r = (r * a) % mod;
a = (a * a) % mod;
}
return r;
}
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
scanf("%lld%lld", &a, &b);
printf("%lld\n", lgpow(a, b));
return 0;
}