Pagini recente » Cod sursa (job #120197) | Cod sursa (job #649170) | Cod sursa (job #2835156) | Statistici Bogdan Togorean (Bogdantogo) | Cod sursa (job #1950868)
#include <iostream>
#include <fstream>
using namespace std;
const int mod=194767;
int modes[2][100000];
int n,s,use,i,j;
int main()
{
ifstream f("1-sir.in");
ofstream g("1-sir.out");
f>>n>>s;
if(s>n*(n-1)/2||s<-n*(n-1)/2)
{
g<<'0';
return 0;
}
modes[1][n*(n-1)]=1;
for(i=1;i<n;i++)
{
use=i%2;
for(j=0;j<=n*(n-1)+1;j++)
{
modes[1-use][j]=0;
}
for(j=0;j<=n*(n-1)+1;j++)
if(modes[use][j])
{
modes[1-use][j]+=modes[use][j];
if(modes[1-use][j]>=mod)
modes[1-use][j]-=mod;
if(j-2*(n-i)>=0)
{
modes[1-use][j-2*(n-i)]+=modes[use][j];
if(modes[1-use][j-2*(n-i)]>=mod)
modes[1-use][j-2*(n-i)]-=mod;
}
}
}
use=1-use;
g<<modes[use][n*(n-1)/2+s];
return 0;
}