Pagini recente » Cod sursa (job #146605) | Cod sursa (job #2654350) | Cod sursa (job #12516) | Cod sursa (job #2872965) | Cod sursa (job #2281209)
#include <bits/stdc++.h>
#define mod 194767
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
int d[2][35000];
int main()
{
int n,s;
in >> n >> s;
if(n*(n-1)/2<s)
{
out << 0;
return 0;
}
d[1][0]=1;
for(int i=2; i<=n; i++)
{
for(int j=0; j<=i*(i-1)/2; j++)
{
d[i%2][j]=(d[(i-1)%2][abs(j-(i-1))]+d[(i-1)%2][j+i-1])%mod;
}
}
out << d[n%2][abs(s)];
return 0;
}