Cod sursa(job #2062998)
Utilizator | Data | 11 noiembrie 2017 00:05:10 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
#define maxN 260
#define MOD 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int s,n,dp[maxN][(maxN-1)*maxN/2];
int main()
{
f>>n>>s;
if(abs(s)>n*(n+1)/2)
{
g<<0;
return 0;
}
dp[1][0] = 1;
for(int i=2;i<=n;i++)
for(int j=0;j<=(i-1)*i/2;j++)
dp[i%2][j]=(dp[(i-1)%2][abs(j+1-i)]+dp[(i-1)%2][abs(j-1+i)])%MOD;
g<<dp[n%2][s];
return 0;
}