Pagini recente » Cod sursa (job #2881934) | Cod sursa (job #2636475) | Cod sursa (job #2606434) | Cod sursa (job #1462423) | Cod sursa (job #2265373)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n,s,d[2][50000];
int main()
{
f>>n>>s;
s = abs(s);
d[1][0] = 1;
for(int i=2;i<=n;i++)
{ for(int j=0;j<=i*(i-1)/2;j++) { d[i%2][j] = d[abs(i%2-1)][abs(j-(i-1))] + d[abs(i%2-1)][j+(i-1)];
d[i%2][j]%=194767;
g<<d[i%2][j]<<' ';
}
g<<'\n';
}
g<<d[n%2][s]<<'\n';
return 0;
}