Cod sursa(job #2265376)
Utilizator | Data | 21 octombrie 2018 00:11:08 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n,s,d[2][50000];
int main()
{
f>>n>>s;
s = abs(s);
if(s>n*(n-1)) g<<0<<'\n';
else { d[1][0] = 1;
for(int i=2;i<=n;i++)
{ for(int j=0;j<=i*(i-1)/2;j++) { d[i%2][j] = d[abs(i%2-1)][abs(j-(i-1))] + d[abs(i%2-1)][j+(i-1)];
d[i%2][j]%=194767;
}
}
}
g<<d[n%2][s]<<'\n';
return 0;
}