Cod sursa(job #2848171)
Utilizator | Data | 12 februarie 2022 10:42:39 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <bits/stdc++.h>
#define int long long
#define MOD 194767
using namespace std;
int dp[66001];
int32_t main()
{
ifstream cin("1-sir.in");
ofstream cout("1-sir.out");
int n, s;
cin >> n >> s;
s = ( (n - 1) * n / 2 - s ) / 2;
dp[0] = 1;
for(int i = 1; i < n; i++)
{
for(int j = s; j >= i; j--)
{
dp[j] = (dp[j] + dp[j - i]) % MOD;
}
}
cout << dp[s];
return 0;
}