Cod sursa(job #2413633)
| Utilizator | Data | 23 aprilie 2019 16:33:27 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
#include <cmath>
#define MOD 194767
using namespace std;
ifstream in ("1-sir.in");
ofstream out ("1-sir.out");
int n, s;
int dp[2][40000];
int ant, cur;
int main()
{
in>>n>>s;
s=abs(s);
if (s>n*(n-1)/2)
{
out<<0;
return 0;
}
dp[ant][0]=1;
ant=0;
cur=1;
for (register int i=2; i<=n; ++i)
{
for (register int j=0; j<=(i-1)*i/2; ++j)
dp[cur][j]=(dp[ant][(int)abs (j-(i-1))]+dp[ant][(int)abs (j+(i-1))])%MOD;
cur=!cur;
ant=!ant;
}
out<<dp[ant][s];
return 0;
}
