Cod sursa(job #2599589)
Utilizator | Data | 11 aprilie 2020 15:10:51 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <bits/stdc++.h>
#define mod 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n, s;
int dp[33000];
int main()
{
f>>n>>s;
s = abs(s);
s = (n * (n - 1) / 2 - s) / 2;
dp[0] = 1;
for(int i = 1;i < n;++i)
for(int j = s;j >= i;--j)
dp[j] = (dp[j] + dp[j - i]) % mod;
g<<dp[s];
return 0;
}