Cod sursa(job #2070249)
Utilizator | Data | 19 noiembrie 2017 13:04:17 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
#define MOD 194767
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int n,s,i,j,d[3][33800];
int main()
{
fin >> n >> s;
///D[N][S] = nr de 1-siruri cu N term care au suma elem S
d[1][0] = 1;
for (i=2; i<=n; i++)
for (j=0; j<=(i-1)*i/2; j++)
d[i%2][j] = (d[(i-1)%2][max(j+1-i, -j-1+i)]+d[(i-1)%2][j-1+i])%MOD;
fout << d[n%2][s];
return 0;
}