61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
57 lines
1.1 KiB
Markdown
57 lines
1.1 KiB
Markdown
---
|
||
id: 5900f5471000cf542c510059
|
||
challengeType: 5
|
||
title: 'Problem 474: Last digits of divisors'
|
||
videoUrl: ''
|
||
localeTitle: 问题474：除数的最后数字
|
||
---
|
||
|
||
## Description
|
||
<section id="description">对于正整数n和数字d，我们将F（n，d）定义为n的除数的数，其最后的数字等于d。例如，F（84,4）= 3.在84的除数中（1,2,3,4,6,7,12,14,21,28,42,84），其中三个（4,14） ，84）有最后一位数字4。 <p>我们还可以验证F（12！，12）= 11和F（50！，123）= 17888。 </p><p>找到F（106！，65432）modulo（1016 + 61）。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler474()</code>应该返回9690646731515010。
|
||
testString: assert.strictEqual(euler474(), 9690646731515010);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler474() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler474();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|