Cod sursa(job #1484061)
| Utilizator | Data | 10 septembrie 2015 13:50:04 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <cstdio>
#define MOD 194767
using namespace std;
int D[2][131000],nMax,n,S,i,j,sol,l;
int main()
{
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d%d", &n, &S);
nMax=n*(n-1)/2;
if(S<=nMax&&S>=(-1*nMax))
{
D[0][nMax]=1;
for(i=2;i<=n;i++)
{
for(j=i-1;j<=2*nMax-i+1;j++)
D[!l][j]=(D[l][j-i+1]+D[l][j+i-1])%MOD;
l=!l;
}
sol=D[l][S];
}
printf("%d", sol);
return 0;
}
