search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
950 B
950 B
id, challengeType, title, videoUrl, localeTitle
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f47d1000cf542c50ff8f | 5 | Problem 272: Modular Cubes, part 2 | 问题272:模块化立方体,第2部分 |
Description
当n = 91时,x有8个可能的值,即:9,16,22,29,53,74,79,81。因此,C(91)= 8。
求出正数n≤1011的总和,其中C(n)= 242。
Instructions
Tests
tests:
- text: <code>euler272()</code>应该返回8495585919506151000。
testString: assert.strictEqual(euler272(), 8495585919506151000);
Challenge Seed
function euler272() {
// Good luck!
return true;
}
euler272();
Solution
// solution required
/section>