search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
1019 B
1019 B
id, challengeType, title, videoUrl, localeTitle
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f5271000cf542c51003a | 5 | Problem 443: GCD sequence | 问题443:GCD序列 |
Description
前几个值是:
n4567891011121314151617181920... g(n)1314161718272829303132333451545560...
给出g(1 000)= 2524和g(1 000 000)= 2624152。
找到g(1015)。
Instructions
Tests
tests:
- text: <code>euler443()</code>应该返回2744233049300770。
testString: assert.strictEqual(euler443(), 2744233049300770);
Challenge Seed
function euler443() {
// Good luck!
return true;
}
euler443();
Solution
// solution required
/section>