Cod sursa(job #2413196)
Utilizator | Puscasu Alexandru alex2kameboss | Data | 23 aprilie 2019 08:19:31 |
---|---|---|---|
Problema | 1-sir | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <cstdio>
#define MOD 194767
using namespace std;
int n,s;
int l;
int p;
int dp[2][33000];
int main()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
scanf("%d%d", &n,&s);
if(s<0)
s*=-1;
if(s>(n-1)*n/2){
cout<<0;
return 0;
}
p = (n*(n-1)/2 - s)/2;
dp[l][0]=1;
l=1;
for(int i = 1; i<=n-1; ++i){
for(int j = 0; j < i; ++j)
dp[l][i+j]=(dp[!l][i+j]+dp[!l][j])%MOD;
l=!l;
}
cout<<dp[!l][p];
return 0;
}