Pagini recente » Cod sursa (job #945794) | Cod sursa (job #2370427) | Cod sursa (job #2083520) | Cod sursa (job #490291) | Cod sursa (job #1212408)
#include<fstream>
using namespace std;
ifstream fi("1-sir.in");
ofstream fo("1-sir.out");
const int max_s = 256*128;
const int MODULO = 194767;
int i,j,linie,n,s;
int d[2][max_s+10];
int modul(const int &a){ if(a<0) return (-a); else return a; }
int main(){
fi>>n>>s; s=modul(s);
if(2*s>(n*(n-1))) fo<<"0";
else{
d[1][0]=1; linie=0;
for(i=2; i<=n; i++,linie^=1)
for(j=0; 2*j<=n*(n-1); j++)
d[linie][j]=(d[linie^1][modul(j-(i-1))]+d[linie^1][j+(i-1)])%MODULO;
linie^=1;
fo<<d[linie][s];
}
fi.close();
fo.close();
return 0;
}