Pagini recente » Cod sursa (job #2769346) | Cod sursa (job #1551803) | Cod sursa (job #1077312) | Cod sursa (job #116233) | Cod sursa (job #1452427)
#include <stdio.h>
#define MAXN 256
#define MAXS 32896
#define MOD 194767
int d[2][2 * MAXS + 1];
inline int as(int x){
return x < 0 ? -x : x;
}
int main(){
FILE *in = fopen("1-sir.in", "r");
int n, s;
fscanf(in, "%d%d", &n, &s);
fclose(in);
FILE *out = fopen("1-sir.out", "w");
if(as(s) <= n * (n - 1) / 2){
int min = -1, max = 1, i, j, lin;
d[1][MAXS - 1] = d[1][MAXS + 1] = 1;
for(i = 2; i < n; i++){
lin = i & 1;
for(j = min - i - 1; j <= max + i + 1; j++){
d[lin][j + MAXS] = 0;
if(j - i - 1 >= -MAXS)
d[lin][j + MAXS] += d[!lin][j - i - 1 + MAXS];
if(j + i + 1 <= MAXS)
d[lin][j + MAXS] += d[!lin][j + i + 1 + MAXS];
if(d[lin][j + MAXS] > 0){
if(j < min)
min = j;
if(j > max)
max = j;
}
if(d[lin][j + MAXS] >= MOD)
d[lin][j + MAXS] -= MOD;
}
}
fprintf(out, "%d", d[(n - 1) & 1][s + MAXS]);
}
else
fprintf(out, "0");
fclose(out);
return 0;
}