Pagini recente » Cod sursa (job #2301918) | Cod sursa (job #1508846) | Cod sursa (job #84892) | Cod sursa (job #2360918) | Cod sursa (job #1589801)
#include <fstream>
#include <cmath>
using namespace std;
const int nMax=256;
const int sMax=(nMax*(nMax-1))/2;
const int Mod=194767;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int N,S,D[nMax][sMax];
void citire()
{
//int i,j;
f>>N>>S;
}
int main()
{
citire();
int i,j;
S=(fabs(S));
D[1][0]=1;
if(N*(N-1)/2<S)
{g<<0;
return 0;}
for(i=2; i<=N; ++i)
for(j=0; j<=i*(i-1)/2; ++j)
{
int x=fabs(j-(i-1));
int y=fabs(j+(i-1));
D[i][j] = (D[i-1][x]+D[i-1][y]) % Mod;
}
g<<D[N][S];
return 0;
}