Cod sursa(job #1926254)
Utilizator | Data | 14 martie 2017 10:42:51 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
const int maxn=257;
const int maxs=(maxn*(maxn-1))/2;
const int mod=194767;
int dp[maxn][maxs];
int main()
{
int n,s,i,j;
fin>>n>>s;
s=abs(s);
dp[1][0]=1;
for(i=2;i<=n;i++)
{
int lim=(i*(i-1))/2;
for(j=0;j<=lim;j++)
{
dp[i][j]=( dp[i-1][(int)abs(j-(i-1))] + dp[i-1][(int)abs(j+(i-1))] )%mod;
}
}
fout<<dp[n][s];
return 0;
}