Pagini recente » Cod sursa (job #2218421) | Cod sursa (job #2090787) | Cod sursa (job #233334) | Cod sursa (job #188231) | Cod sursa (job #829760)
Cod sursa(job #829760)
#include<cstdio>
#include<cstdlib>
#define MOD 194767
using namespace std;
FILE *f,*g;
int n,smax,a[2][60000];
/*int abs(int x)
{
if(x>0)
return x;
return -x;
}*/
int main()
{
f=fopen("1-sir.in","r");
g=fopen("1-sir.out","w");
int i,p,s,j;
fscanf(f,"%d%d",&n,&s);
int sol;
smax=n*(n-1);
if(smax<abs(s))
{
sol=0;
}
else
{
a[0][0]=1;
p=1;
for(i=2;i<=n;p=p^1,++i)
{
for(j=0;j<=smax;++j)
{
a[p][j]=a[p^1][j+i-1]+a[p^1][abs(j-(i-1))];
if(a[p][j]>=MOD)
a[p][j]-=MOD;
}
}
if(n%2)
sol=a[0][s];
else
sol=a[1][s];
}
fprintf(g,"%d\n",sol);
return 0;
}