56 lines
838 B
Markdown
56 lines
838 B
Markdown
---
|
||
id: 5900f3b81000cf542c50fecb
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
localeTitle: 问题76：计算总结
|
||
---
|
||
|
||
## Description
|
||
<section id="description">可以用六种不同的方式将五个作为总和写成：4 + 1 3 + 2 3 + 1 + 1 2 + 2 + 1 2 + 1 + 1 + 1 1 + 1 + 1 + 1 + 1多少个不同一百种方式可以写成至少两个正整数的总和？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler76()</code>应该返回190569291。
|
||
testString: assert.strictEqual(euler76(), 190569291);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler76() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler76();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|