freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-124-ordered-radical...

1.3 KiB
Raw Blame History

id challengeType title videoUrl localeTitle
5900f3e81000cf542c50fefb 5 Problem 124: Ordered radicals 问题124有序的激进分子

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

Instructions

Tests

tests:
  - text: <code>euler124()</code>应返回21417。
    testString: 'assert.strictEqual(euler124(), 21417, "<code>euler124()</code> should return 21417.");'

Challenge Seed

function euler124() {
  // Good luck!
  return true;
}

euler124();

Solution

// solution required