freeCodeCamp/problem-78-coin-partitions.english.md at 81a0c0c8e07a6c3a4f99228a8af10967fa0c53d9

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.0 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3ba1000cf542c50fecd	5	Problem 78: Coin partitions

Description

Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.

OOOOO OOOO O OOO OO OOO O O OO OO O OO O O O O O O O O

Find the least value of n for which p(n) is divisible by one million.

Instructions

Tests

tests:
  - text: <code>euler78()</code> should return 55374.
    testString: assert.strictEqual(euler78(), 55374, '<code>euler78()</code> should return 55374.');

Challenge Seed

function euler78() {
  // Good luck!
  return true;
}

euler78();

Solution

// solution required

1.0 KiB Raw Blame History