Pagini recente » Cod sursa (job #2347934) | Cod sursa (job #1165811) | Cod sursa (job #1347630) | Cod sursa (job #979379) | Cod sursa (job #1452432)
#include <stdio.h>
#define MAXN 256
#define MAXS 32896
#define MOD 194767
int d[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 i, j, lin;
d[1][1] = 1;
for(i = 2; i < n; i++){
lin = i & 1;
for(j = (i + 2) * (i + 1) / 2; j >= 0; j--){
d[lin][j] = 0;
if(j + i + 1 <= MAXS)
d[lin][j] += d[!lin][j + i + 1];
d[lin][j] += d[!lin][as(j - i - 1)];
if(d[lin][j] >= MOD)
d[lin][j] -= MOD;
}
}
fprintf(out, "%d", d[(n - 1) & 1][s]);
}
else
fprintf(out, "0");
fclose(out);
return 0;
}