63 lines
911 B
Markdown
63 lines
911 B
Markdown
---
|
|
id: 5900f3b81000cf542c50fecb
|
|
challengeType: 5
|
|
title: 'Problem 76: Counting summations'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
It is possible to write five as a sum in exactly six different ways:
|
|
4 + 1
|
|
3 + 2
|
|
3 + 1 + 1
|
|
2 + 2 + 1
|
|
2 + 1 + 1 + 1
|
|
1 + 1 + 1 + 1 + 1
|
|
How many different ways can one hundred be written as a sum of at least two positive integers?
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler76()</code> should return 190569291.
|
|
testString: assert.strictEqual(euler76(), 190569291, '<code>euler76()</code> should return 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>
|