Pagini recente » Cod sursa (job #131709) | Cod sursa (job #561050) | Cod sursa (job #1605259) | Cod sursa (job #2273433) | Cod sursa (job #42030)
Cod sursa(job #42030)
#include <cstdio>
#define maxn 100
#define mod 194767
int dp[maxn][maxn*(maxn-1)/2];
int N, S;
int main()
{
freopen("1-sir.in", "r", stdin);
scanf("%d %d\n", &N, &S);
int i, j;
dp[1][1]=1;
for(i=2;i<=N;i++)
for(j=0;j<=S;j++)
{
dp[i][j]=dp[i-1][j+(i-1)];
if(j-(i-1)>=0) dp[i][j]+=dp[i-1][j-(i-1)];
//dp[i][j]=dp[i-1][j-(i)]+dp[i-1][j+(i)], dp[i][j]%=mod;
dp[i][j]%=mod;
}
if(S<0) S=-S;
/*
for(i=1;i<=N;i++)
{
for(j=1;j<=S;j++) printf("%d ", dp[i][j]);
printf("\n");
}
*/
freopen("1-sir.out", "w", stdout);
printf("%d\n", dp[N][S]);
return 0;
}