Pagini recente » Istoria paginii runda/lets_go_oni/clasament | Istoria paginii runda/abcdfegh/clasament | Cod sursa (job #2691574) | preoji/clasament/9 | Cod sursa (job #2361470)
# include <iostream>
# include <fstream>
# include <algorithm>
# include <cmath>
using namespace std;
ifstream fi ("lgput.in");
ofstream fo ("lgput.out");
const int dim = 1000001;
const long long mod = 1999999973;
long long n, m, s;
long long Pow(int baza, int exp) {
if ( exp == 0)
return 1;
long long aux = Pow(baza,exp / 2);
if ( (exp & 1) == 1)
return (1LL * aux * aux %mod * baza) % mod;
else
return (1LL * aux * aux) % mod;
}
int main ()
{
fi >> m >> n;
fo << Pow(m,n);
fi.close();
fo.close();
return 0;
}