56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
|||
|
id: 5900f4461000cf542c50ff58
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 217: Balanced Numbers'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题217:平衡数字
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">具有k(十进制)数字的正整数称为平衡,如果其第一个⌈k/2⌉数字总和为与其最后的⌈k/2⌉数字相同的值,其中⌈x⌉,x的发音上限,是最小整数≥x,因此⌈π⌉= 4且⌈5⌉= 5.因此,例如,所有回文都是平衡的,如13722.设T(n)是所有平衡数小于10n的总和。因此:T(1)= 45,T(2)= 540,T(5)= 334795890.求T(47)mod 315 </section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler217()</code>应该返回6273134。
|
|||
|
testString: 'assert.strictEqual(euler217(), 6273134, "<code>euler217()</code> should return 6273134.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler217() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler217();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|