Pagini recente » Cod sursa (job #3154548) | Cod sursa (job #2148755) | Cod sursa (job #2709484) | Cod sursa (job #2185397) | Cod sursa (job #1276035)
#include<stdio.h>
const int mod=9999991;
int pow(int a,int m)
{
int r;
for(r=1;m;m>>=1)
{
if (m&1)
r=(1LL*r*a)%mod;
a=(1LL*a*a)%mod;
}
return r;
}
inline int invmod(int k)
{
return pow(k,mod-2);
}
int r(int n)
{
int num=1,den=1;
for(int i=2;i<=n;i++)
{
num=(1LL*num*(n+i))%mod;
den=(1LL*den*(i))%mod;
}
return (1LL*num*invmod(den))%mod;;
}
int main()
{
freopen("dirichlet.in","r",stdin);
freopen("dirichlet.out","w",stdout);
int n;
scanf("%d",&n);
printf("%d\n",r(n));
return 0;
}