Pagini recente » Cod sursa (job #1799819) | Monitorul de evaluare | Cod sursa (job #2692525) | Cod sursa (job #1013269) | Cod sursa (job #7405)
Cod sursa(job #7405)
#include <stdio.h>
#define NMAX 258
#define MOD 194767
int A[NMAX][NMAX][NMAX];
int N, S;
int main()
{
int i, j, k, sum;
freopen("1-sir.in", "r", stdin);
scanf("%d %d", &N, &S);
A[1][0][0] = 1;
for (i = 2; i <= N; i++)
for (j = 0; j < S; j++)
for (k = 0; k <= S-j+1; k++)
if ((k-j >= 0))
{
A[i][j+1][k+j+1] = (A[i][j+1][k+j+1]+A[i-1][j][k])%MOD;
if (j > 0) A[i][j-1][k+j-1] = (A[i][j-1][k+j-1]+A[i-1][j][k])%MOD;
}
sum = 0;
for (i = 0; i <= N; i++) sum = (sum+A[N][i][S])%MOD;
freopen("1-sir.out", "w", stdout);
printf("%d\n", sum);
return 0;
}