Pagini recente » Cod sursa (job #249063) | Cod sursa (job #1467357) | Cod sursa (job #272088) | Cod sursa (job #2763653) | Cod sursa (job #1443155)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
const int NMax = 260;
const int MOD = 194767;
int d[2][2 * NMax * NMax];
int main()
{
int n, sum, m;
fin >> n >> sum;
m = n * (n - 1) / 2;
sum = m - sum;
d[0][0] = d[1][0] = 1;
for(int i = 1; i < n; i++){
for(int j = 0; j <= sum; j++){
d[1][j + 2 * i] += d[0][j];
if(d[1][j + 2 * i] >= MOD){
d[1][j + 2 * i] -= MOD;
}
}
for(int j = 0; j <= sum; j++){
d[0][j] = d[1][j];
if(d[0][j] >= MOD){
d[0][j] -= MOD;
}
}
}
fout << d[0][sum];
return 0;
}