Cod sursa(job #1473780)
Utilizator | Data | 20 august 2015 10:34:19 | |
---|---|---|---|
Problema | 1-sir | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
ifstream fi("1-sir.in");
ofstream fo("1-sir.out");
long d[260][33000],n,s;
int main()
{
fi >> n >> s;
d[1][0] = 1;
for (int i=2; i<=n; i++) {
for (int j=0; j<=n*(n-1)/2; j++) {
d[i][j] = d[i-1][abs(j-(i-1))] + d[i-1][j+(i-1)];
}
}
fo << d[n][abs(s)];
return 0;
}