freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.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

772 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4291000cf542c50ff3b 问题188数字的过度扩展 5 problem-188-the-hyperexponentiation-of-a-number

--description--

由↑^ b或ba表示的正整数b的数字a的过度增强或分解通过以下方式递归地定义a↑↑1 = aa↑↑k + 1= aa↑↑k )。

因此我们有例如3↑↑2 = 33 = 27因此3↑↑3 = 327 = 7625597484987和3↑↑4大致是103.6383346400240996 * 10 ^ 12。查找1777↑↑1855的最后8位数字。

--hints--

euler188()应该返回95962097。

assert.strictEqual(euler188(), 95962097);

--seed--

--seed-contents--

function euler188() {

  return true;
}

euler188();

--solutions--

// solution required