Cod sursa(job #681093)
Utilizator | Data | 16 februarie 2012 15:36:38 | |
---|---|---|---|
Problema | Dirichlet | Scor | 8 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<cstdio>
#define MOD 9999991
void read(),solve(),back(int,int);
long long C[1000010];
int i,n;
int main()
{
read();
solve();
return 0;
}
void read()
{
freopen("dirichlet.in","r",stdin);
freopen("dirichlet.out","w",stdout);
scanf("%d",&n);
}
void solve()
{
C[1]=1;
if(n==1)printf("1\n");
for(i=1;i<n;i++)
{
C[i+1]=((4*i+2)*C[i])/(i+2);
if(C[i+1]>MOD)C[i+1]%=MOD;
}
printf("%lld\n",C[n]);
}