Cod sursa(job #2412900)
Utilizator | Veltan Victor victorv88 | Data | 22 aprilie 2019 17:18:46 |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
#define MOD 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n, s, dp[2][33000];
int main()
{
f >> n >> s;
if (s>32896 || s<-32896)
{
g << 0;
return 0;
}
dp[1][0]=1;
for (int i=2; i<=n; ++i)
{
for (int j=0; j<=i*(i-1)/2; ++j)
{
dp[i%2][j]=dp[(i-1)%2][abs(j-(i-1))]+dp[(i-1)%2][j+(i-1)];
dp[i%2][j]%=MOD;
}
}
g << dp[n%2][s];
return 0;
}