Pagini recente » Cod sursa (job #693784) | Monitorul de evaluare | Istoria paginii runda/test4234234 | Cod sursa (job #189056) | Cod sursa (job #2002041)
#include<fstream>
#define mod 194767
using namespace std;
int n,s,x,y,i,j;
int d[256 * 256];
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int main()
{
f>>n>>s;
if(s<0) s=-s;
x=n*(n-1)/2;
if(s>x||(x-s)%2==1)
{
g<<"0\n";
}
d[0]=1;
for(i=n-1; i>=1; i--)
{
y+=i;
for(j=y-i; j>=0; j--)
{
d[j+i]+=d[j];
if(d[j+i]>=mod)
{
d[j+i]-=mod;
}
}
}
g<<d[(x-s)/2]<<"\n";
f.close(); g.close();
return 0;
}