Pagini recente » Cod sursa (job #1539758) | Borderou de evaluare (job #1036205) | Cod sursa (job #1531221) | Cod sursa (job #598920) | Cod sursa (job #1334724)
#include<fstream>
#define mod 194767
using namespace std;
ifstream f("1-sir.in"); ofstream g("1-sir.out");
int n,s,p,smax,D[2][40000];
int main()
{ f>>n>>s;
smax=n*(n-1)/2;
if(abs(s)>smax) g<<"0\n";
else
{ p=1;
D[p][0]=1;
for(int i=2;i<=n;++i)
{ for(int j=0;j<=smax;++j)
{ D[1-p][j]=D[p][j+i-1]+D[p][abs(j-(i-1))];
if(D[1-p][j]>=mod) D[1-p][j]-=mod;
}
p=1-p;
}
g<<D[p][s]<<'\n';
}
g.close(); return 0;
}