56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
|||
|
id: 5900f5331000cf542c510046
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 455: Powers With Trailing Digits'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题455:使用尾随数字的权力
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">设f(n)是小于109的最大正整数x,使得nx的最后9位数字形成数字x(包括前导零),或者如果不存在这样的整数则为零。 <p>例如: </p><p> f(4)= 411728896(4411728896 = ... 490411728896)f(10)= 0 f(157)= 743757(157743757 = ... 567000743757)Σf(n),2≤n≤103= 442530011399查找Σf(n ),2≤n≤106。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler455()</code>应该返回450186511399999。
|
|||
|
testString: 'assert.strictEqual(euler455(), 450186511399999, "<code>euler455()</code> should return 450186511399999.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler455() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler455();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|