Pagini recente » Istoria paginii runda/123455/clasament | Diferente pentru problema/examene intre reviziile 19 si 24 | Rezultatele filtrării | Cod sursa (job #2448658) | Cod sursa (job #1622563)
#include <bits/stdc++.h>
#define mod 1999999973
#define ll long long
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
ll x, y;
void read() {
f>>x>>y;
}
ll fast(ll x, ll p) {
if (p == 0) return 1;
if (p % 2 == 0) return (fast((x*x)%mod, p/2))%mod;
return (x*(fast((x*x)%mod, (p-1)/2)%mod))%mod;
}
int main() {
read();
g<<fast(x,y)<<'\n';
f.close(); g.close();
return 0;
}