Cod sursa(job #2524496)
Utilizator | Data | 15 ianuarie 2020 20:11:11 | |
---|---|---|---|
Problema | 1-sir | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
const int N = 260;
const int Mod = 194767;
int n, s, v, dp[N * N];
int main()
{
fin >> n >> s;
int v = n * (n - 1) / 2 - s;
dp[0] = 1;
for (int i = 1; i < n; ++i)
for (int j = v; j >= 0; --j)
dp[j] = (dp[j] + dp[j - i]) % Mod;
fout << dp[v];
}