Pagini recente » Cod sursa (job #1578017) | Istoria paginii runda/runda_lot | Cod sursa (job #2358195) | Cod sursa (job #1910288) | Cod sursa (job #216071)
Cod sursa(job #216071)
#include <stdio.h>
#define DIM 2*65561
int A[DIM], B[DIM],i,k,s,n;
int main(){
FILE *f = fopen("1-sir.in","r");
fscanf(f,"%d %d", &n,&s);
fclose(f);
FILE *g = fopen("1-sir.out","w");
if ((s>n*(n-1)/2)||((s<-n*(n-1)/2))){
fprintf(g,"%d",0);
fclose(g);
return 0;
}
A[1] = 1;
A[0] = 0;
for (k=3;k<=n;k++) {
for (i=0;i<=2*s;i++)
B[i] = A[(i-(k-1)>0)?(i-(k-1)):(-i+(k-1))] + A[(i+k-1>0)?(i+k-1):(i-k+1)];
for (i=0;i<=2*s;i++)
A[i] = B[i];
}
fprintf(g,"%d",A[s]);
fclose(g);
return 0;
}