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
846 B
Markdown
43 lines
846 B
Markdown
---
|
|
id: 5900f4de1000cf542c50fff0
|
|
title: 'Problem 369: Badugi'
|
|
challengeType: 5
|
|
forumTopicId: 302030
|
|
dashedName: problem-369-badugi
|
|
---
|
|
|
|
# --description--
|
|
|
|
In a standard 52 card deck of playing cards, a set of 4 cards is a Badugi if it contains 4 cards with no pairs and no two cards of the same suit.
|
|
|
|
Let f(n) be the number of ways to choose n cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
|
|
|
|
Find ∑f(n) for 4 ≤ n ≤ 13.
|
|
|
|
# --hints--
|
|
|
|
`euler369()` should return 862400558448.
|
|
|
|
```js
|
|
assert.strictEqual(euler369(), 862400558448);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler369() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler369();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|