* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
63 lines
943 B
Markdown
63 lines
943 B
Markdown
---
|
||
id: 5900f3e81000cf542c50fefb
|
||
title: 问题124:有序的激进分子
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-124-ordered-radicals
|
||
---
|
||
|
||
# --description--
|
||
|
||
n,rad(n)的基数是n的不同素因子的乘积。例如,504 = 23×32×7,因此rad(504)= 2×3×7 = 42.如果我们计算1≤n≤10的rad(n),则在rad(n)上对它们进行排序,并进行排序如果激进值相等,我们得到:未分类
|
||
|
||
排序n rad(n)
|
||
|
||
n rad(n)k 11
|
||
|
||
111 22
|
||
|
||
222 33
|
||
|
||
423 42
|
||
|
||
824 55
|
||
|
||
335 66
|
||
|
||
936 77
|
||
|
||
557 82
|
||
|
||
668 93
|
||
|
||
779 1010
|
||
|
||
101010令E(k)为有序n列中的第k个元素;例如,E(4)= 8且E(6)= 9.如果rad(n)按1≤n≤100000排序,则找到E(10000)。
|
||
|
||
# --hints--
|
||
|
||
`euler124()`应返回21417。
|
||
|
||
```js
|
||
assert.strictEqual(euler124(), 21417);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler124() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler124();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|