56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
|||
|
id: 5900f4de1000cf542c50fff0
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 369: Badugi'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题369:Badugi
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">在标准的52张扑克牌中,一套4张牌是Badugi,如果它包含4张没有成对的牌而没有两张相同牌的牌。 <p>设f(n)是选择n卡的方式的数量,其中4卡的子集是Badugi。例如,有2598960种方法可以从标准的52卡片组中选择5张卡片,其中514800包含4个卡片子集,这是Badugi,因此f(5)= 514800。 </p><p>找到Σf(n)为4≤n≤13。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler369()</code>应该返回862400558448。
|
|||
|
testString: 'assert.strictEqual(euler369(), 862400558448, "<code>euler369()</code> should return 862400558448.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler369() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler369();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|