Pagini recente » Cod sursa (job #386482) | Cod sursa (job #1363537) | Cod sursa (job #327943) | Cod sursa (job #2303408) | Cod sursa (job #1550918)
#include <cstdio>
#include <algorithm>
#include <cstring>
#define Mod 194767
#define Smax (256*256)+5
using namespace std;
int n, s;
int dp[2][Smax];
int main()
{
int i, j;
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
scanf("%d %d",&n, &s);
dp[1][0] = 1;
for (i = 2; i <= n; i ++)
{
for (j = 0; j <= i * (i - 1) / 2; j ++)
dp[i % 2][j] = (dp[(i - 1) % 2][abs(j - i + 1)] + dp[(i - 1) % 2][abs(j + i - 1)])% Mod;
memset(dp[(i - 1) % 2], 0, sizeof(dp[(i - 1) % 2]));
}
printf("%d\n",dp[n % 2][s]);
return 0;
}