ee1e8abd87
* 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>
885 B
885 B
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f4e51000cf542c50fff8 | Problem 377: Sum of digits, experience 13 | 5 | 302039 | problem-377-sum-of-digits-experience-13 |
--description--
There are 16 positive integers that do not have a zero in their digits and that have a digital sum equal to 5, namely:
5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111.
Their sum is 17891.
Let f(n) be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to n.
Find \\displaystyle \\sum\_{i=1}^{17} f(13^i). Give the last 9 digits as your answer.
--hints--
euler377() should return 732385277.
assert.strictEqual(euler377(), 732385277);
--seed--
--seed-contents--
function euler377() {
return true;
}
euler377();
--solutions--
// solution required