k***s
发帖数: 206 | 1 Two players play a best of 5 game (3 wins end the game). How many paths are
there for this game? |
n******r
发帖数: 1247 | 2 2^5-(2^2-1)*2-(2-1)*3*2=20
画个二叉树的图只考虑Win的情况然后乘2也很方便
are
【在 k***s 的大作中提到】
: Two players play a best of 5 game (3 wins end the game). How many paths are
: there for this game?
|
s*******s
发帖数: 1568 | 3 20, use binomial model(Dynamic programming) to compute
are
【在 k***s 的大作中提到】
: Two players play a best of 5 game (3 wins end the game). How many paths are
: there for this game?
|
S*****o
发帖数: 715 | 4 胜者要赢三场，这三场可以在5个位置取，就是5取3的组合数，乘2就是20
are
【在 k***s 的大作中提到】
: Two players play a best of 5 game (3 wins end the game). How many paths are
: there for this game?
|
d*j
发帖数: 13780 | 5 赞！
【在 S*****o 的大作中提到】
: 胜者要赢三场，这三场可以在5个位置取，就是5取3的组合数，乘2就是20
:
: are
|
n******r
发帖数: 1247 | 6 nice
【在 S*****o 的大作中提到】
: 胜者要赢三场，这三场可以在5个位置取，就是5取3的组合数，乘2就是20
:
: are
|
