Pagini recente » Cod sursa (job #3211079) | Cod sursa (job #1292769) | Cod sursa (job #2081840) | Cod sursa (job #2952952) | Cod sursa (job #16641)
Cod sursa(job #16641)
#include <stdio.h>
#include <math.h>
#define NMAX (1<<16)
#define MOD 194767
int A[2][NMAX], N, S;
int main()
{
int i, j, d = 1, s = 0;
freopen("1-sir.in", "r", stdin);
scanf("%d %d", &N, &S);
S = abs(S);
if (S > N*(N-1)/2) return 0;
A[s][0] = 1;
for (i = 2; i <= N; i++)
{
for (j = 0; j <= S; j++)
A[d][j] = (((j-i+1)>=0)*A[s][j-i+1]+A[s][j+i-1])%MOD;
d = (d+1)&1; s = (s+1)&1;
}
freopen("1-sir.out", "w", stdout);
printf("%d\n", A[d][S]);
return 0;
}