Cod sursa(job #988046)
Utilizator | Petru Stefan Friptu stefan.friptu | Data | 21 august 2013 21:11:41 |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<cstdio>
#include<cstdlib>
#define mod 194767
int v[2][65540];
int n,i,j,k,s,l;
int main()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
scanf("%d%d",&n,&s);
k=n*(n-1)/2;
if(s>k)
{
printf("0\n");
return 0;
}
v[1][0]=1;
l=0;
for(i=2;i<=n;++i)
{
for(j=0;j<=k;++j)
{
v[l][j]=v[1-l][j+i-1]+v[1-l][abs(j-i+1)];
if(v[l][j]>=mod)
v[l][j]-=mod;
}
l=1-l;
}
printf("%d\n",v[1-l][s]);
return 0;
}