Pagini recente » Cod sursa (job #2379421) | Cod sursa (job #613386) | Cod sursa (job #2752455) | Cod sursa (job #2229517) | Cod sursa (job #1484083)
#include <cstdio>
#include <cmath>
#define MOD 194767
using namespace std;
int nMax,n,S,i,j,sol,l,p;
int D[2][40000];
int main()
{
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d%d", &n, &S);
nMax=n*(n-1)/2;
D[0][0]=1;
for(i=2;i<=n;i++)
{
for(j=0;j<=nMax;j++)
{
p=j-i+1;
D[!l][j]=D[l][j+i-1];
if(p<0)
p=0-p;
D[!l][j]+=D[l][p];
if(D[!l][j]>=MOD)
D[!l][j]-=MOD;
}
l=!l;
}
sol=D[l][S];
printf("%d", sol);
return 0;
}