Pagini recente » Cod sursa (job #661823) | Cod sursa (job #3151920) | Cod sursa (job #210227) | Cod sursa (job #1955679) | Cod sursa (job #2511235)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("1-sir.in");
ofstream g ("1-sir.out");
constexpr int MOD = 194767;
int n, Sum;
int dp[100000];
int main()
{
f >> n >> Sum;
int Sum_Max = n * (n-1) / 2;
Sum = (Sum_Max - Sum)/2;
dp[0] = 1;
for (int i = 1; i < n; ++i)
for (int j = Sum; j-i >= 0; --j)
dp[j] = (dp[j] + dp[j-i]) % MOD;
g << dp[Sum] << '\n';
return 0;
}