Cod sursa(job #2102941)
| Utilizator | Data | 9 ianuarie 2018 17:24:35 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int N,S,dp[256][32651];
int main()
{
f>>N>>S;
const int val=N*(N-1)/2;
if(S<-val || S>val){
g<<0;
return 0;
}
dp[1][0]=1;
for(int i=2;i<=N;++i)
for(int j=1;j<=i*(i-1)/2;++j)
dp[i][j]=(dp[i-1][j+(i-1)]+dp[i-1][abs(j-(i-1))])%194767;
g<<dp[N][abs(S)];
return 0;
}
