Loading docs/math/catalan.md +15 −21 Original line number Diff line number Diff line Loading @@ -44,13 +44,9 @@ $$ H_n = \binom{2n}{n} - \binom{2n}{n-1} $$ ``` f[n] = f[0] * f[n - 1] + f[1] * f[n - 2] + ... + f[n - 1] * f[0] ``` 具体实例 [https://www.luogu.org/problem/P1044](洛谷 P1044 栈) ``` 具体实例[https://www.luogu.org/problem/P1044](洛谷 P1044 栈) #include <iostream> Loading @@ -68,8 +64,6 @@ int main(){ cout << f[n] << endl; return 0; } ``` ## 路径计数问题 Loading Loading
docs/math/catalan.md +15 −21 Original line number Diff line number Diff line Loading @@ -44,13 +44,9 @@ $$ H_n = \binom{2n}{n} - \binom{2n}{n-1} $$ ``` f[n] = f[0] * f[n - 1] + f[1] * f[n - 2] + ... + f[n - 1] * f[0] ``` 具体实例 [https://www.luogu.org/problem/P1044](洛谷 P1044 栈) ``` 具体实例[https://www.luogu.org/problem/P1044](洛谷 P1044 栈) #include <iostream> Loading @@ -68,8 +64,6 @@ int main(){ cout << f[n] << endl; return 0; } ``` ## 路径计数问题 Loading