Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

708 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f47d1000cf542c50ff8f Problem 272: Modular Cubes, part 2 5 301922 problem-272-modular-cubes-part-2

--description--

For a positive number n, define C(n) as the number of the integers x, for which 1

When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, C(91)=8.

Find the sum of the positive numbers n≤1011 for which C(n)=242.

--hints--

euler272() should return 8495585919506151000.

assert.strictEqual(euler272(), 8495585919506151000);

--seed--

--seed-contents--

function euler272() {

  return true;
}

euler272();

--solutions--

// solution required