Cod sursa(job #1640954)
Utilizator | Darius Pop Darius15 | Data | 8 martie 2016 20:05:37 |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int i,j,d[257][32641],MOD=194767,n,s,sum;
int main()
{
f>>n>>s;
sum=n*(n-1)/2;
if (sum<max(s,-s)) g<<-1;
else
{
d[1][0]=1;
for (i=2;i<=n;i++)
{
for (j=0;j<=i*(i-1)/2;j++)
d[i][j]=d[i-1][j+i-1]+d[i-1][max(j-(i-1),i-1-j)],d[i][j]%=MOD;
}
g<<d[n][max(s,-s)]<<'\n';
}
return 0;
}