Pagini recente » Cod sursa (job #280292) | Cod sursa (job #2532185) | Monitorul de evaluare | Cod sursa (job #623152) | Cod sursa (job #2265220)
#include <fstream>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int modul(int x)
{
return max(x, -x);
}
int d[2][45000], n, s;
int main()
{
int c=0;
fin>>n>>s;
if(s<0) s=-s;
if(s>n*(n-1)) {fout<<"0\n"; return 0;}
d[1][0]=1;
c=n*(n-1)/2;
bool b=1;
for(int j=2;j<=n;++j)
{
for(int i=0;i<=c;++i)
d[!b][i]=d[b][modul(i-(j-1))]+d[b][i+(j-1)], d[!b][i]%=194767;
b=!b;
}
fout<<d[b][s];
return 0;
}