Pagini recente » Cod sursa (job #1091573) | Cod sursa (job #346258) | Cod sursa (job #1428483) | Cod sursa (job #2878807) | Cod sursa (job #1842561)
#include <iostream>
#include <stdlib.h>
#include <fstream>
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
int main()
{
int dp[257][100];
int n, s;
in >> n >> s;
if(s < 0)
s *= -1;
int k = n * (n + 1) / 2;
if(s > k){
out << 0;
return 0;
}
dp[1][0] = 1;
dp[0][0] = 1;
for(int i = 1; i <= n ; i ++)
for(int j = 1; j <= i*(i-1)/2 ; j ++){
int x = abs(j - (i - 1));
int y = abs(j + (i - 1));
dp[i][j] = dp[i - 1][x] + dp[i - 1][y];
}
cout << dp[n][s] % 194767;
}