Pagini recente » Cod sursa (job #2167645) | Cod sursa (job #1275265) | Cod sursa (job #2225066) | Cod sursa (job #763040) | Cod sursa (job #1950914)
#include <iostream>
#include <fstream>
using namespace std;
const int mod=194767;
int modes[2*256*256+1];
int n,s,use,i,j,low;
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[n*(n-1)]=1;
low=n*(n-1)/2+s;
for(i=1;i<n;i++)
{
use=i%2;
for(j=max(low,2*(n-i));j<=n*(n-1)+1;j++)
if(modes[j])
{
modes[j-2*(n-i)]+=modes[j];
if(modes[j-2*(n-i)]>=mod)
modes[j-2*(n-i)]-=mod;
}
}
g<<modes[n*(n-1)/2+s];
return 0;
}