Pagini recente » Cod sursa (job #1933990) | Cod sursa (job #2532352) | Cod sursa (job #2613339) | Cod sursa (job #1455838) | Cod sursa (job #1207154)
#include<stdio.h>
#define MOD 194767
#define MAX 32640
int mod[2][MAX+1+256];
inline int abs(int nr)
{
if(nr<0)
return -nr;
return nr;
}
int main(){
FILE *fin,*fout;
fin=fopen("1-sir.in","r");
fout=fopen("1-sir.out","w");
int n,s;
fscanf(fin,"%d%d",&n,&s);
int i,cont=1,sol=0,max=n*(n-1)/2;
mod[0][0]=1;
for(i=2;i<=n;i++){
int j;
for(j=0;j<=max;j++)
mod[cont][j]=(mod[(1-cont)][abs(j-(i-1))]+mod[(1-cont)][abs(j+(i-1))])%MOD;
for(j=0;j<=max;j++)
mod[(1-cont)][j]=0;
cont=(1-cont);
}
if(s<0)
s=-s;
if(s>=0&&s<=max)
fprintf(fout,"%d",mod[(1-cont)][s]);
else
fprintf(fout,"%d",0);
return 0;
}