Pagini recente » Cod sursa (job #3039669) | Cod sursa (job #84527) | Cod sursa (job #3247335) | Cod sursa (job #488824) | Cod sursa (job #3243096)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
const int MOD=9999991;
long long putere(long long x, long long m)
{
long long val=1;
while(m>0)
{
if(m%2)
val=1LL*val*x%MOD;
x=1LL*x*x%MOD;
m/=2;
}
return val;
}
long long catalan(int n)
{
long long c=1,f=1;
for(int i=2;i<=n;i++)
{
c=1LL*c*(n+i)%MOD;
f=1LL*f*i%MOD;
}
c=1LL*c*putere(f,MOD-2)%MOD;
return c;
}
int main()
{
int n;
f>>n;
g<<catalan(n);
return 0;
}