Pagini recente » Cod sursa (job #2492937) | Cod sursa (job #668369) | Cod sursa (job #663991) | Cod sursa (job #2700245) | Cod sursa (job #1989633)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("1-sir.in");
ofstream out ("1-sir.out");
int const nmax = 256;
int const modulo = 194767;
int v[2][((nmax * nmax)>>1)];
int main()
{
int n , s;
in>>n>>s;
s = fabs(s);
if(((n * (n - 1))>>1) < s){
out<<0;
return 0;
}
v[0][0] = 1;
int lim;
for(int i = 2 ; i <= n ;i++){
lim = ((i * (i - 1)) >> 1);
for(int j = 0 ; j <= lim ;j++){
v[1][j] = ( v[0][(int)fabs(j - (i - 1))] + v[0][j + (i - 1)]) % modulo;
}
for(int j = 0 ; j <= lim ;j++){
v[0][j] = v[1][j];
v[1][j] = 0;
}
}
out<<v[0][s];
return 0;
}