Pagini recente » Cod sursa (job #1649246) | Cod sursa (job #36979) | Cod sursa (job #1271185) | Cod sursa (job #1518085) | Cod sursa (job #7540)
Cod sursa(job #7540)
#include <stdio.h>
#define sm 70000
#define mod 194767
int n, s, S, a[sm];
int main()
{
int i, j;
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d%d", &n, &s);
S = n * (n - 1) / 2;
a[2 * S] = 1;
for (i = 2; i <= n; ++i)
for (j = 0; j <= 2 * S; ++j)
if (j >= 2 * (n - i + 1))
a[j - 2 * (n - i + 1)] = (a[j - 2 * (n - i + 1)] + a[j]) % mod;
printf("%d\n", a[s + S]);
return 0;
}