Pagini recente » Cod sursa (job #568249) | Cod sursa (job #2132082) | Cod sursa (job #586806) | Cod sursa (job #2607601) | Cod sursa (job #2383234)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD = 9999991;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
long long power(long long a, int b)
{
long long p = 1;
while(b)
{
if(b & 1)
p = p * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return p;
}
int main()
{
int N;
f >> N;
long long A = 1, B = 1;
for(int i = 2; i <= N; i++)
{
A = A * (N + i) % MOD;
B = B * i % MOD;
}
g << A*power(B, MOD - 2) % MOD;
return 0;
}