Pagini recente » Cod sursa (job #2884206) | Cod sursa (job #2752359) | Cod sursa (job #1417992) | Cod sursa (job #248113) | Cod sursa (job #1628320)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("dirichlet.in");
ofstream fout("dirichlet.out");
#define MOD 9999991
#define MAX 1000010
int pow(int a, int p)
{
int rez = 1;
while(p)
{
if(p & 1)
rez = (1ll * rez * a) % MOD;
p >>= 1;
a = (1ll * a * a) % MOD;
}
return rez;
}
int main()
{
int n, t, i, rez = 1;
fin >> n;
t = 1;
for(i = 1 ; i <= n ; i++)
t = (1ll * t * i) % MOD;
rez = (1ll * rez * pow(t, 2 * (MOD - 2))) % MOD;
rez = (1ll * rez * pow(n + 1, MOD - 2)) % MOD;
for(i = n + 1 ; i <= 2 * n ; i++)
t = (1ll * t * i) % MOD;
rez = (1ll * rez * t) % MOD;
fout << rez << "\n";
}