Pagini recente » Cod sursa (job #1518176) | Cod sursa (job #1959838) | Cod sursa (job #1390776) | Cod sursa (job #769281) | Cod sursa (job #2228377)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f; ofstream g;
long long power(long long x, long long n)
{
//cout << x << ' ' << n << endl;
if (n == 0) return (1);
else if (n == 1) return (x % 1999999973);
else if (n % 2) return ((x % 1999999973) * power((x * x) % 1999999973, (n - 1) / 2));
else power((x * x) % 1999999973, n / 2);
}
int main(void)
{
long long n, m;
f.open("lgput.in");
f >> n >> m;
f.close();
g.open("lgput.out");
g << power(n, m);
g.close();
//cout << 1024 % 1999999973;
return (0);
}