Pagini recente » Cod sursa (job #2651481) | Cod sursa (job #1543511) | Cod sursa (job #1981800) | Cod sursa (job #2547373) | Cod sursa (job #1481991)
#include<stdio.h>
#include<algorithm>
#include<cmath>
#define maxs 33000
#define MOD 194767
using namespace std;
int n,S,sol;
int a[maxs],b[maxs];
void read(){
scanf("%d %d",&n,&S);
}
void solve()
{
S=abs(S);
if(S>n*(n-1)/2) return;
a[0]=1;
for(int i=2;i<=n;i++)
{
for(int j=0;j<=i*(i-1)/2;j++)
{
b[j]=a[abs(j-i+1)]+a[j+i-1];
if(b[j]>=MOD) b[j]-=MOD;
}
for(int j=0;j<=i*(i-1)/2;j++) a[j]=b[j];
}
sol=a[S];
}
int main()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
read();
solve();
printf("%d",sol);
fclose(stdin);
fclose(stdout);
return 0;
}