Cod sursa(job #2848160)
Utilizator | Data | 12 februarie 2022 10:41:17 | |
---|---|---|---|
Problema | 1-sir | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define MOD 194767
using namespace std;
int dp[66001];
int 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[1] = 1;
for(int i = 2; i <= n; i++)
{
for(int j = s; j >= i; j--)
{
dp[j] = (dp[j] + dp[j - i]) % MOD;
}
}
cout << dp[s];
return 0;
}