Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* 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>
2021-01-12 19:31:00 -07:00

63 lines
943 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3e81000cf542c50fefb
title: 问题124有序的激进分子
challengeType: 5
videoUrl: ''
dashedName: problem-124-ordered-radicals
---
# --description--
nradn的基数是n的不同素因子的乘积。例如504 = 23×32×7因此rad504= 2×3×7 = 42.如果我们计算1≤n≤10的radn则在radn上对它们进行排序并进行排序如果激进值相等我们得到未分类
排序n radn
n radnk 11
111 22
222 33
423 42
824 55
335 66
936 77
557 82
668 93
779 1010
101010令Ek为有序n列中的第k个元素;例如E4= 8且E6= 9.如果radn按1≤n≤100000排序则找到E10000
# --hints--
`euler124()`应返回21417。
```js
assert.strictEqual(euler124(), 21417);
```
# --seed--
## --seed-contents--
```js
function euler124() {
return true;
}
euler124();
```
# --solutions--
```js
// solution required
```