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>
786 B
786 B
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f5271000cf542c510039 | Problem 442: Eleven-free integers | 5 | 302114 | problem-442-eleven-free-integers |
--description--
An integer is called eleven-free if its decimal expansion does not contain any substring representing a power of 11 except 1.
For example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not.
Let E(n) be the nth positive eleven-free integer. For example, E(3) = 3, E(200) = 213 and E(500 000) = 531563.
Find E(1018).
--hints--
euler442() should return 1295552661530920200.
assert.strictEqual(euler442(), 1295552661530920200);
--seed--
--seed-contents--
function euler442() {
return true;
}
euler442();
--solutions--
// solution required