freeCodeCamp/problem-63-powerful-digit-counts.chinese.md at 07e665052db4724a4fb45f820722d8186ba5dbe5

Files

Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220 )

* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions

2020-03-03 18:49:47 +05:30

836 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3ab1000cf542c50febe	5	Problem 63: Powerful digit counts		问题63：强大的数字计数

Description

5位数字，16807 = 75，也是第五种力量。类似地，9位数字134217728 = 89是第九次幂。存在多少个n位正整数，它们也是n次幂？

Instructions

Tests

tests:
  - text: <code>euler63()</code>应该返回49。
    testString: assert.strictEqual(euler63(), 49);

Challenge Seed

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

euler63();

Solution

// solution required

836 B Raw Blame History Unescape Escape