Pagini recente » Cod sursa (job #2958408) | Cod sursa (job #298378) | Cod sursa (job #2470767) | Cod sursa (job #3187279) | Cod sursa (job #1312724)
#include <fstream>
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
const int NMAX = 256;
const int SMAX = 256*254/2;
const int MOD = 194767;
int d[NMAX+1][NMAX*NMAX+1];
int N,S;
int main() {
in >> N >> S;
d[0][0] = 1;
S = max( S, -S );
if( S > SMAX ) {
out << "0\n";
return 0;
}
int ind = 1;
for( int i = 2; i <= N; ++i, ind = 1-ind ) {
for( int j = 0; j <= i*(i-1)/2; ++j ) {
d[ind][j] = (d[1-ind][ max(j-(i-1), (i-1)-j) ] + d[1-ind][ max(j+(i-1), -(i-1)-j) ]) % MOD;
}
}
out << d[1-ind][S];
return 0;
}