6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
1.1 KiB
1.1 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3b81000cf542c50fecb | 5 | Problem 76: Counting summations | 302189 |
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
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?
Instructions
Tests
tests:
- text: <code>countingSummations()</code> should return a number.
testString: assert(typeof countingSummations() === 'number');
- text: <code>countingSummations()</code> should return 190569291.
testString: assert.strictEqual(countingSummations(), 190569291);
Challenge Seed
function countingSummations() {
// Good luck!
return true;
}
countingSummations();
Solution
// solution required