Pagini recente » Cod sursa (job #559997) | Cod sursa (job #1528246) | Cod sursa (job #2352471) | Cod sursa (job #774598) | Cod sursa (job #1526544)
#include <fstream>
#include <iostream>
#include <cstdlib>
#define MOD 194767
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int d[260][33000],n,s;
int abs(int x)
{
if (x<0) x=-x;
return x;
}
int main()
{
fin >> n >> s;
d[1][0] = 1;
for (int i=2; i<=n; i++) {
for (int j=0; j<=i*(i+1)/2; j++) {
d[i][j] = (d[i-1][abs(j-(i-1))] + d[i-1][j+(i-1)]) % MOD;
}
}
fout << d[n][abs(s)];
}