56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
||
id: 5900f4771000cf542c50ff89
|
||
challengeType: 5
|
||
title: 'Problem 266: Pseudo Square Root'
|
||
videoUrl: ''
|
||
localeTitle: 问题266：伪平方根
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> 12的除数是：1,2,3,4,6和12. 12的最大除数不超过12的平方根是3.我们将称为整数n的最大除数，它不超过n的伪平方根（PSR）的平方根。可以看出PSR（3102）= 47。 <p>设p是190以下质数的乘积。求PSR（p）mod 1016。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler266()</code>应该返回1096883702440585。
|
||
testString: 'assert.strictEqual(euler266(), 1096883702440585, "<code>euler266()</code> should return 1096883702440585.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler266() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler266();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|