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