Pagini recente » Cod sursa (job #2447430) | Cod sursa (job #2518269) | Cod sursa (job #1101453) | Cod sursa (job #2910753) | Cod sursa (job #2460251)
#include <cstdio>
using namespace std;
const int mod = 1999999973;
#define ll long long
ll power(ll a, ll n, ll mod) {ll p=1;while(n > 0){if(n%2) {p = p * a; p %= mod;} n >>= 1; a *= a; a %= mod;} return p % mod;}
ll modpow(ll a,ll b,ll MOD) {ll res=1;a%=MOD;for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}
//template <typename T> inline T Pow(T base,T exp,T mod){ull x = 1, y = base;while(exp>0){if(exp&1) x = Mulmod(x,y,mod);y = Mulmod(y,y,mod);exp >>= 1;}return x;}
int main(){
ll a,b,c;
FILE *in = fopen("lgput.in","r"), *out = fopen("lgput.out","w");
fscanf(in, "%lld %lld", &a, &b);
fprintf(out, "%lld\n", modpow(a, b,mod));
return 0;
}