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>
40 lines
800 B
Markdown
40 lines
800 B
Markdown
---
|
||
id: 5900f4231000cf542c50ff34
|
||
title: 问题181：调查两种不同颜色的对象可以分组的方式
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: >-
|
||
problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped
|
||
---
|
||
|
||
# --description--
|
||
|
||
有三个黑色物体B和一个白色物体W它们可以用7种方式分组：（BBBW）（B，BBW）（B，B，BW）（B，B，B，W）（B，BB，W） （BBB，W）（BB，BW）在六十个黑色物体B和四十个白色物体W的分组方式中有多少种？
|
||
|
||
# --hints--
|
||
|
||
`euler181()`应该返回83735848679360670。
|
||
|
||
```js
|
||
assert.strictEqual(euler181(), 83735848679360670);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler181() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler181();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|