freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md

id	challengeType	videoUrl	localeTitle
5900f3ab1000cf542c50febe	5		问题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

/section>