Pagini recente » Cod sursa (job #895309) | Cod sursa (job #826340) | Cod sursa (job #244981) | Cod sursa (job #1173795)
#include <fstream>
#include <cstring>
#define MOD 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int N,S;
int DP[2][256*255/2+5];
inline int mod(int x)
{
return max(x,-x);
}
void Solve_Dinamic()
{
int i,j,aux=0;
DP[1][0]=1;
S=mod(S);
if(S>N*(N-1)/2)
{
g<<0<<"\n";
return;
}
for(i=2;i<=N;i++,aux=1-aux)
{
for(j=0;j<=i*(i-1)/2;j++)
{
DP[aux][j]=DP[1-aux][j+i-1]+DP[1-aux][mod(j-(i-1))];
while(DP[aux][j]>=MOD)
DP[aux][j]-=MOD;
}
}
g<<DP[1-aux][S]<<"\n";
}
int main()
{
f>>N>>S;
Solve_Dinamic();
return 0;
}