Cod sursa(job #2478199)
Utilizator | Data | 21 octombrie 2019 19:08:49 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
const int NMAX = 900005;
const int mod = 194767;
int n, s, dp[NMAX];
int main()
{
int i,j;
fin >> n >> s;
s = max(s, -s);
s = n * (n - 1) / 2 - s;
dp[0] = 1;
s /= 2;
for(i = 1 ; i < n ; i++)
for(j = s - i ; j >= 0 ; j--)
dp[j + i] = (dp[j] + dp[j + i]) % mod;
fout << dp[s];
return 0;
}