Pagini recente » Cod sursa (job #1239799) | Cod sursa (job #566135) | Cod sursa (job #340645) | Cod sursa (job #377257) | Cod sursa (job #46073)
Cod sursa(job #46073)
#include <fstream.h>
long n,s,d[5][256/2*255],i,oth=1,j;
inline long abs(long a)
{ if (a<0) return -a;
return a;
}
int main()
{
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
fin>>n>>s;
if (s<0)
s*=-1;
d[0][0]=1;
for (i=1;i<=n;i++)
{
for (j=0;j<=s;j++)
d[i][j]=d[1-oth][abs(j-(i-1))]+d[1-oth][abs(j+(i-1))];
oth*=-1;
}
fout<<d[n][s]<<'\n';
return 0;
}