Pagini recente » Cod sursa (job #800870) | Cod sursa (job #378692) | Cod sursa (job #951989) | Cod sursa (job #2405072) | Cod sursa (job #50993)
Cod sursa(job #50993)
#include <fstream>
#define MAX 2200000000
#define MOD 194767
using namespace std;
int M[2][MAX];
int n, s;
int main(void)
{ifstream fin("1-sir.in");
fin>>n>>s;
fin.close();
if(s<0) s=-s;
int k=1;
M[0][0]=1;
int i, j, aux;
for(i=2;i<=n;++i)
for(j=0, aux=i*(i-1)/2; j<=aux;++j)
{if(j-i+1 < 0) M[k][j]=M[!k][i-j-1];
else M[k][j]=M[!k][j-i+1];
M[k][j]=(M[k][j]+M[!k][j+i-1]) % MOD;
k=!k;
}
ofstream fout("1-sir.out");
fout<<M[!k][s]<<'\n';
fout.close();
return 0;
}