Pagini recente » Cod sursa (job #2238276) | Cod sursa (job #2370232) | Cod sursa (job #82974) | Cod sursa (job #393724) | Cod sursa (job #2096844)
#include <fstream>
#define modulo 9999991
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
long long int n, rez = 1, aux = 1, rez_power, c, bit;
int main()
{
f >> n;
for (long long int i = n + 2; i <= 2*n; i++) rez = (rez*i) % modulo;
for (long long int i = 1; i <= n; i++) aux = (aux*i) % modulo;
bit = modulo - 2;
rez_power = 1;
c = aux;
while (bit) {
if (bit & 1) rez_power = (rez_power*c) % modulo;
c = (c*c) % modulo;
bit >>= 1;
}
g << (rez*rez_power) % modulo;
f.close();
g.close();
return 0;
}