Pagini recente » Cod sursa (job #2129272) | Cod sursa (job #669339) | Cod sursa (job #1653734) | Cod sursa (job #3036547) | Cod sursa (job #42025)
Cod sursa(job #42025)
#include <cstdio>
#define maxn 32
#define maxt 128
int dp[2*maxn][maxn*maxn][maxn];
int n, s;
int main()
{
scanf("%d %d", &n, &s);
printf("%d\n", s);
int i, j, k;
dp[2][-1+maxt][-1+maxn]=1;
dp[2][1+maxt][1+maxn]=1;
for(i=3;i<=n;i++)
for(j=-s;j<=s;j++)
for(k=-n;k<=n;k++)
dp[i][j+maxt][k+maxn]=dp[i-1][j-k+maxt][k-1+maxn]+dp[i-1][j-k+maxt][k+1+maxn];
int sum=0;
for(i=-n;i<=n;i++) printf("%d ", dp[3][-3+maxt][i+maxn]);
for(i=-n;i<=n;i++)
sum+=dp[n][s+maxt][i+maxn];
printf("%d\n", sum);
return 0;}