Cod sursa(job #1553888)
| Utilizator | Data | 20 decembrie 2015 17:57:55 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("1-sir.in");
ofstream out("1-sir.out");
#define MOD 194767
int dp[257][65282],n;
int main()
{ long long s;
int n;
in>>n>>s;dp[1][0]=1;
for(int i=2;i<=n;i++)
for(int j=0;j<=(n*(n-1))/2;j++)
dp[i%2][j]=(dp[(i+1)%2][abs(j-(i-1))]+dp[(i+1)%2][abs(j+(i-1))])%MOD;
if(abs(s)>abs((n*(n-1)/2)))out<<0;else out<<dp[n%2][s];
return 0;
}
