Pagini recente » Cod sursa (job #2643890) | Cod sursa (job #1547198) | Cod sursa (job #2520717) | Cod sursa (job #1534641) | Cod sursa (job #221311)
Cod sursa(job #221311)
#include <cstdio>
#include <cmath>
const int N = 5;
const int S = N*(N+1)/2;
int n,s;
int d[N+1][S+1];
int main() {
freopen("1-sir.in","rt",stdin);
freopen("1-sir.out","wt",stdout);
scanf("%d %d",&n,&s);
d[0][0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= i*(i+1)/2; ++j) {
d[i][j] = d[i-1][(int)fabs((double)j-(i-1))] + d[i-1][(int)fabs((double)j+(i+1))];
printf("%d ",d[i][j]);
}
printf("\n");
}
printf("%d\n",d[n][s]);
return 0;
}