Pagini recente » Cod sursa (job #293126) | Cod sursa (job #2822675) | Cod sursa (job #3199361) | Cod sursa (job #1588781) | Cod sursa (job #2553316)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int n,s,lin,pr,i,j,dp[3][32775];
int main()
{
fin>>n;
fin>>s;
dp[1][0]=1;
if((n-1)*n/2<abs(s))
{
fout<<0;
return 0;
}
for(i=2; i<=n; i++)
{
lin=i&1;
pr=1-lin;
for(j=0; j<=i*(i-1)/2; j++)
{
dp[lin][j]=max(dp[pr][abs(j-i+1)],dp[pr][abs(j+i-1)]);
}
}
fout<<dp[n&1][s];
return 0;
}