Pagini recente » Cod sursa (job #986119) | Cod sursa (job #2149074) | Diferente pentru runda/viata_periculoasa_pe_infoarena2/clasament intre reviziile 2 si 1 | Cod sursa (job #460638) | Cod sursa (job #1318189)
#include <cstdio>
#include <cstdlib>
#define supermax 32640
#define SMax 40000
#define MOD 194768
using namespace std;
int N,S,Smax;
int DP[SMax];
void Read()
{
scanf("%d%d",&N,&S);
if(S < 0)
S *= -1;
if(S > supermax){
printf("0\n");
exit(0);
}
Smax = N * (N - 1) / 2;
S = Smax - S;
}
void Solve()
{
int w;
DP[0] = 1;
for(int i = 1; i < N; ++i)
{
w = 2*i;
for(int j = (i+1)*i; j >= w; --j)
DP[j] = (DP[j] + DP[j-w])%MOD;
}
printf("%d\n",DP[S]);
}
int main()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
Read();
Solve();
return 0;
}