Cod sursa(job #2511235)
| Utilizator | Data | 18 decembrie 2019 16:44:11 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#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;
}
