Pagini recente » Cod sursa (job #593221) | Cod sursa (job #1735639) | Cod sursa (job #776058) | Cod sursa (job #2597931) | Cod sursa (job #2033223)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n,s,d[256][256][256];
void citire()
{
f>>n>>s;
}
void rez()
{
d[1][0][0]=1;
int minim=-1;
int maxim=1;
for (int i=2;i<=n;i++)
{
for (int j=minim;j<=maxim;j++)
{
for (int k=minim;k<=maxim;k++)
{
d[i][j][k]=d[i-1][j-k][k+1]+d[i-1][j-k][k-1];
}
}
minim=minim-i;
maxim=maxim+i;
}
int suma=0;
for (int i=minim;i<=maxim;i++)
{
suma=suma+d[n][s][i];
}
g<<suma;
}
int main()
{
citire();
rez();
return 0;
}