Pagini recente » Cod sursa (job #726609) | Cod sursa (job #1118827) | Cod sursa (job #2355587) | Cod sursa (job #2215420) | Cod sursa (job #2555037)
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <cmath>
using namespace std;
int main()
{
int N,S,K;
cin >> N >> S;
K = N * (N - 1) / 2;
if(fabs(S) > N * (N - 1) / 2) {
cout << "0\n";
return 0;
}
D[1][0] = 1;
int P = 0;
for(int i = 2 ; i <= N ; ++ i) {
for(int j = 0 ; j < K ; ++ j) {
D[P][j] = D[1-P][j+i-1] + D[1-P][abs(j - i + 1)];
D[P][j] %= 194767;
}
P = 1 - P;
}
cout << D[1-P][S] << '\n';
}