Cod sursa(job #637187)
| Utilizator |  Casian Patrascanu caheman |
Data | 20 noiembrie 2011 12:48:05 |
|---|---|---|---|
| Problema | Dirichlet | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | .com 2011 | Marime | 0.35 kb |
#include<stdio.h>
long long x[1000001][1000001];
int main()
{
freopen("dirichlet.in","r",stdin);
freopen("dirichlet.out","w",stdout);
long n;
long long i,j,s;
scanf("%d",&n);
x[1][0]=1;
x[1][1]=1;
for(i=2;i<=n;i++)
{
s=0;
for(j=0;j<=i*(i+1)/2;j++)
{
s+=x[i-1][j];
x[i][j]=s;
}
}
printf("%d",x[n][n]);
return 0;
}