Cod sursa(job #2553312)
Utilizator | Data | 21 februarie 2020 20:59:48 | |
---|---|---|---|
Problema | 1-sir | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#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][32768];
int main()
{
fin>>n;
fin>>s;
dp[1][0]=1;
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%2][s];
return 0;
}