Pagini recente » Cod sursa (job #2292253) | Cod sursa (job #3132259) | Cod sursa (job #163586) | Cod sursa (job #129970) | Cod sursa (job #874909)
Cod sursa(job #874909)
#include <fstream>
using namespace std;
ifstream in ("lgput.in");
ofstream out ("lgput.out");
const int M = 1999999973;
long long put(int n, int p)
{
if (p == 1) {
return n;
} else if (n % 2 == 1) {
return put((long long)n * n % M, p/2);
} else if (n % 2 == 0) {
return (long long)n * put((long long)n * n % M, (n - 1)/2)%M;
}
}
int main()
{
int numar, putere;
in >> numar >> putere;
out << put(numar, putere) << "\n";
return 0;
}