ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
43 lines
798 B
Markdown
43 lines
798 B
Markdown
---
|
||
id: 5900f4de1000cf542c50fff0
|
||
title: 问题369：Badugi
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-369-badugi
|
||
---
|
||
|
||
# --description--
|
||
|
||
在标准的52张扑克牌中，一套4张牌是Badugi，如果它包含4张没有成对的牌而没有两张相同牌的牌。
|
||
|
||
设f（n）是选择n卡的方式的数量，其中4卡的子集是Badugi。例如，有2598960种方法可以从标准的52卡片组中选择5张卡片，其中514800包含4个卡片子集，这是Badugi，因此f（5）= 514800。
|
||
|
||
找到Σf（n）为4≤n≤13。
|
||
|
||
# --hints--
|
||
|
||
`euler369()`应该返回862400558448。
|
||
|
||
```js
|
||
assert.strictEqual(euler369(), 862400558448);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler369() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler369();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|