56 lines
1.6 KiB
Markdown
56 lines
1.6 KiB
Markdown
|
---
|
|||
|
|
id: 5900f53b1000cf542c51004d
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 462: Permutation of 3-smooth numbers'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题462：3个平滑数的排列
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description"> 3平滑数是没有素数因子大于3的整数。对于整数N，我们将S（N）定义为小于或等于N的3平滑数的集合。例如，S（20）= {1,2,3,4,6,8,9,12,16,18}。 <p>我们将F（N）定义为S（N）的排列数，其中每个元素都在其所有适当的除数之后。 </p><p>这是N = 20的可能排列之一。 </p><ul><li> 1,2,4,3,9,8,16,6,18,12。这不是有效的排列，因为12在它的除数6之前出现。 </li><li> 1,2,4,3,9,8,12,16,6,18。 </li></ul><p>我们可以验证F（6）= 5，F（8）= 9，F（20）= 450和F（1000）≈8.8521816557e21。找到F（1018）。给出你的答案，它的科学记数在小数点后四舍五入到十位数。在给出答案时，使用小写e来分隔尾数和指数。例如，如果答案是112,233,445,566,778,899，则答案格式为1.1223344557e17。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler462()</code>应返回Infinity。
|
|||
|
|
testString: 'assert.strictEqual(euler462(), Infinity, "<code>euler462()</code> should return Infinity.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler462() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler462();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|