freeCodeCamp/problem-78-coin-partitions.english.md at c5a087f8b734f9eff9ad6966014d3f6cc88f7034

Files

Kristofer Koishigawa 6cfd0fc503 fix: improve Project Euler descriptions, challenge seeds, and test cases (#38016 )

* 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

2020-02-28 06:39:47 -06:00

1.3 KiB

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f3ba1000cf542c50fecd	5	Problem 78: Coin partitions	302191

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.

Coin piles
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>coinPartitions()</code> should return a number.
    testString: assert(typeof coinPartitions() === 'number');
  - text: <code>coinPartitions()</code> should return 55374.
    testString: assert.strictEqual(coinPartitions(), 55374);

Challenge Seed

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

coinPartitions();

Solution

// solution required

1.3 KiB Raw Blame History