Cod sursa(job #2511233)
| Utilizator | Data | 18 decembrie 2019 16:38:07 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("1-sir.in");
ofstream g ("1-sir.out");
constexpr int MOD = 194767;
int n;
int S;
int dp[100005];
int main()
{
f >> n >> S;
int Sum_Max = n * (n-1) / 2;
S = (Sum_Max - S) / 2;
dp[0] = 1;
for (int i = 1; i < n; ++i)
{
for (int sum = S; sum >= i; --sum)
{
dp[sum] += dp[i-sum];
dp[sum] %= MOD;
}
}
g << dp[S] << '\n';
return 0;
}
