Pagini recente » Cod sursa (job #253103) | Cod sursa (job #2538558) | Cod sursa (job #1487109) | Cod sursa (job #131786) | Cod sursa (job #2384054)
#include <cstdio>
using namespace std;
const int MOD = 9999991;
int fp(int a, int b){
int aa = a, p;
for(p = 1;b;b = b >> 1){
if(b & 1)
p = 1LL * p * aa % MOD;
aa = 1LL * aa * aa % MOD;
}
return p;
}
int main()
{
freopen("dirichlet.in", "r", stdin);
freopen("dirichlet.out", "w", stdout);
int n, i, p, x, y, p1, p2;
scanf("%d", &n);
p = 1;
for(i = 1;i <= 2 * n;i++){
p = 1LL * p * i % MOD;
if(i == n){
p1 = p;
}
if(i == n + 1)
p2 = p;
}
x = fp(p1, MOD - 2);
y = fp(p2, MOD - 2);
printf("%d", (1LL * p * x % MOD * y % MOD) % MOD);
return 0;
}