Cod sursa(job #2450203)
Utilizator | Adia R. adiaioana | Data | 22 august 2019 12:24:38 |
---|---|---|---|
Problema | 1-sir | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
#define MOD 194767
using namespace std;
ifstream cin("1-sir.in");
ofstream cout("1-sir.out");
int N,S, dp[260][33000],r,smic;
int main()
{
cin>>N>>S;
smic=N*(N-1)/2;
r=(smic-S)/2;
if(r<0|| (smic-S)%2!=0)
{
cout<<0<<'\n';
return 0;
}
else if(r==0)
{
cout<<1<<'\n';
return 0;
}
dp[0][0]=1;
for(int k=1; k<N; ++k)
{
for(int s=0; s<=r; ++s)
{
dp[k][s]=(dp[k-1][s]+dp[k-1][s-k]);
if(dp[k][s]>=MOD)
dp[k][s]-=MOD;
}
}
cout<<dp[N-1][r]<<'\n';
return 0;
}