Pagini recente » Cod sursa (job #2807030) | Cod sursa (job #2334436) | Cod sursa (job #1335928) | Cod sursa (job #759528) | Cod sursa (job #2655375)
#include <fstream>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int v[2][33800];
int main()
{
int i,j,mod=194767,t,n,s;
f>>n>>s;
if (s<0) s=-s;
v[0][0]=1;
for (i=2;i<=n;i++) {
t=i*(i-1)/2;
for (j=0;j<=t;j++)
{v[1][j]=v[0][j+(i-1)]+v[0][max(j-(i-1),-j+(i-1))];
if (v[1][j]>=mod) v[1][j]-=mod;
}
for (j=0;j<=t;j++) {
v[0][j]=v[1][j];
v[1][j]=0;
}
}
g<<v[0][s];
}