search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
1013 B
1013 B
id, challengeType, title, videoUrl, localeTitle
| id | challengeType | title | videoUrl | localeTitle |
|---|---|---|---|---|
| 5900f3d91000cf542c50feeb | 5 | Problem 108: Diophantine Reciprocals I | 问题108:丢番图互惠I |
Description
1/6 + 1/12 = 1/4
1/8 + 1/8 = 1/4不同解的数量超过一千的n的最小值是多少?
Instructions
Tests
tests:
- text: diophantineOne <code>diophantineOne()</code>应返回180180。
testString: assert.strictEqual(diophantineOne(), 180180);
Challenge Seed
function diophantineOne() {
// Good luck!
return true;
}
diophantineOne();
Solution
// solution required
/section>