Cod sursa(job #1910361)
Utilizator | Data | 7 martie 2017 16:35:07 | |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include<bits/stdc++.h>
#define mod 194767
#define maxN 260
using namespace std;
int n,s,dp[2][35005],t;
int main()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
scanf("%d%d",&n,&s);
if(s<0) s=-s;
dp[0][0]=1;
for(int i=2;i<=n;i++)
{
t=i*(i-1)/2;
for(int j=0;j<=t;j++)
{
dp[1][j]=dp[0][j+(i-1)]+dp[0][max(j-(i-1),-j+(i-1))];
}
for(int j=0;j<=t;j++)
{
dp[0][j]=dp[1][j]%mod;
dp[1][j]=0;
}
}
printf("%d\n",dp[0][s]);
return 0;
}