OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
combined
(merge:
0ece962
ff1f1a7
)
Merge branch 'master' of https://github.com/24OI/OI-wiki.git
author
CJSoft
<egwcyh@qq.com>
Sun, 19 Aug 2018 17:15:44 +0000
(
01:15
+0800)
committer
CJSoft
<egwcyh@qq.com>
Sun, 19 Aug 2018 17:15:44 +0000
(
01:15
+0800)
1
2
docs/math/combination.md
patch
|
diff1
|
diff2
|
blob
|
history
diff --cc
docs/math/combination.md
index
b499900
,
506a458
..
36b65a1
---
1
/
docs/math/combination.md
---
2
/
docs/math/combination.md
+++ b/
docs/math/combination.md
@@@
-89,9
-89,9
+89,9
@@@
$n$ ç§
\8d
ä¸
\8d
ä¸
\80
æ ·ç
\9a
\84
ç
\90
\83
ï¼
\8c
æ¯
\8f
ç§
\8d
ç
\90
\83
ç
\9a
\84
ä¸
中间还是 $k$ 个数!不过已经不是 $b$ 系列,而是 $c$ 系列,**假设 $c[i]=b[i]+i-1$,所以**
-$$1 \le c_1 < c_2 < c_3 < c_4 < \cdots <c_k \le n+k-1$$
+$$1 \le c_1 < c_2 < c_3 < c_4 < \cdots <
c_k \le n+k-1$$
- 所以问题就开始转换为无重复组合问题,即在 $n+k-1$ 个元素中选中 $k$ 个的组合数$C_{n+k-1}^{k}$。
+ 所以问题就开始转换为无重复组合问题,即在 $n+k-1$ 个元素中选中 $k$ 个的组合数
$C_{n+k-1}^{k}$。
###不相邻的排列