56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f3e91000cf542c50fefc
|
||
challengeType: 5
|
||
title: 'Problem 125: Palindromic sums'
|
||
videoUrl: ''
|
||
localeTitle: 问题125：回文总和
|
||
---
|
||
|
||
## Description
|
||
<section id="description">回文数595很有意思，因为它可以写成连续正方形的总和：62 + 72 + 82 + 92 + 102 + 112 + 122.正好有11个以下的回文可以写成连续的平方和，并且这些回文的总和是4164.注意，没有包括1 = 02 + 12，因为该问题涉及正整数的平方。找到小于108的所有数字的总和，这些数字都是回文并且可以写为连续正方形的总和。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler125()</code>应该返回2906969179。
|
||
testString: 'assert.strictEqual(euler125(), 2906969179, "<code>euler125()</code> should return 2906969179.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler125() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler125();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|