Pagini recente » Cod sursa (job #2119) | Cod sursa (job #371048) | Cod sursa (job #2494929) | Cod sursa (job #691220) | Cod sursa (job #1923348)
#include <fstream>
using namespace std;
const int MOD = 1999999973;
int n, p;
int power(int n, int p)
{
int rez = 1;
while(p)
{
if (p % 2)
{
//rez *= n;
rez = (1LL * rez * n) % MOD;
p--;
}
n = (1LL * n * n) % MOD;
p /= 2;
}
return rez;
}
int main()
{
ifstream f("lgput.in");
ofstream g("lgput.out");
f >> n >> p;
f.close();
int x = power(n+1, p);
g<<x % MOD <<"\n";
g.close();
return 0;
}