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

Files

Beau Carnes 2ca3a2093f Add languages Russian, Arabic, Chinese, Portuguese (#18305 )

2018-10-11 03:33:03 +05:30

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次幂？

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

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

euler63();

// solution required