Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.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

844 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f4931000cf542c50ffa5 Problem 294: Sum of digits - experience #23 5 301946 problem-294-sum-of-digits---experience-23

--description--

For a positive integer k, define d(k) as the sum of the digits of k in its usual decimal representation.

Thus d(42) = 4+2 = 6.

For a positive integer n, define S(n) as the number of positive integers k < 10n with the following properties : k is divisible by 23 and d(k) = 23.

You are given that S(9) = 263626 and S(42) = 6377168878570056.

Find S(1112) and give your answer mod 109.

--hints--

euler294() should return 789184709.

assert.strictEqual(euler294(), 789184709);

--seed--

--seed-contents--

function euler294() {

  return true;
}

euler294();

--solutions--

// solution required