search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
1.0 KiB
1.0 KiB
id, challengeType, title, videoUrl, localeTitle
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4931000cf542c50ffa5 | 5 | Problem 294: Sum of digits - experience #23 | 问题294:数字总和-经验#23 |
Description
对于正整数n,将S(n)定义为具有以下属性的正整数k <10n的数量: k可被23整除 d(k)= 23。
给出S(9)= 263626和S(42)= 6377168878570056。
找到S(1112)并给出答案mod 109。
Instructions
Tests
tests:
- text: <code>euler294()</code>应该返回789184709。
testString: assert.strictEqual(euler294(), 789184709);
Challenge Seed
function euler294() {
// Good luck!
return true;
}
euler294();
Solution
// solution required
/section>