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

47 lines
885 B
Markdown

---
id: 5900f4e51000cf542c50fff8
title: 'Problem 377: Sum of digits, experience 13'
challengeType: 5
forumTopicId: 302039
dashedName: 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.
```js
assert.strictEqual(euler377(), 732385277);
```
# --seed--
## --seed-contents--
```js
function euler377() {
return true;
}
euler377();
```
# --solutions--
```js
// solution required
```