Cod sursa(job #1496170)
| Utilizator | Data | 4 octombrie 2015 15:18:02 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <cstdio>
#include <algorithm>
#define MOD 194767
using namespace std;
int n,s;
int d[2][50000];
int main()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
scanf("%d%d",&n,&s);
d[1][0]=1;
for(int i = 2; i <= n; ++i)
for(int j = 0; j <= i * (i-1)/2; ++j)
{
d[i%2][j] = (d[(i+1)%2][abs(j-i+1)] + d[(i+1)%2][j+i-1]) % MOD;
}
printf("%d\n",d[(n)%2][abs(s)]);
return 0;
}
