Pagini recente » Cod sursa (job #1781033) | Cod sursa (job #1414730) | Cod sursa (job #1283555) | Cod sursa (job #1881432) | Cod sursa (job #941715)
Cod sursa(job #941715)
#include<cstdio>
using namespace std;int i,p,mod,n;
int pow(int a,int b)
{int i,p=1;for(i=0;(1<<i)<=b;i++){if(b&(1<<i)) p=(1LL*p*a)%mod;a=(1LL*a*a)%mod;}return p;}
int factorial(int n)
{int i=0,p=1;for(i=1;i<=n;i++)p=(1LL*p*i)%mod;return p;}
int main()
{freopen("dirichlet.in","r",stdin);freopen("dirichlet.out","w",stdout);scanf("%d",&n);mod=9999991;p=1;for(i=2*n;i>n;i--)p=(1LL*p*i)%mod;printf("%d\n",(1LL*p*pow(factorial(n+1),mod-2) )%mod);return 0;}