Files
freeCodeCamp/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
Nicholas Carrigan (he/him) 3da4be21bb chore: seed chinese traditional (#42005)
Seeds the chinese traditional files manually so we can deploy to
staging.
2021-05-05 22:43:49 +05:30

886 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f3b81000cf542c50fecb Problem 76: Counting summations 5 302189 problem-76-counting-summations

--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?

--hints--

countingSummations() should return a number.

assert(typeof countingSummations() === 'number');

countingSummations() should return 190569291.

assert.strictEqual(countingSummations(), 190569291);

--seed--

--seed-contents--

function countingSummations() {

  return true;
}

countingSummations();

--solutions--

// solution required