Cod sursa(job #221453)
| Utilizator | Data | 16 noiembrie 2008 15:22:30 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <cstdio>
#include <cstdlib>
#define mod 194767
int n, s, sum;
int v[2][33670];
int main()
{
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d %d", &n, &s);
sum = n * (n+1) / 2;
int i, j, k = 0;
v[1][0] = 1;
for(i = 2; i <= n; ++i)
{
for(j = 0; j <= sum; ++j)
{
v[k][j] = (v[k^1][abs(j-i+1)] + v[k^1][abs(j+i-1)]) % mod;
}
k ^= 1;
}
printf("%d\n", v[k^1][abs(s)]);
return 0;
}
