1.3 KiB
1.3 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3f91000cf542c50ff0b | 5 | Problem 141: Investigating progressive numbers, n, which are also square | 问题141:调查渐进数n,它们也是正方形 |
Description
Instructions
Tests
tests:
- text: <code>euler141()</code>应该返回878454337159。
testString: 'assert.strictEqual(euler141(), 878454337159, "<code>euler141()</code> should return 878454337159.");'
Challenge Seed
function euler141() {
// Good luck!
return true;
}
euler141();
Solution
// solution required