freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-29-distinct-powers.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f3891000cf542c50fe9c	5	Problem 29: Distinct powers

Description

undefined

Instructions

undefined

Tests

tests:
  - text: ''
    testString: 'assert.strictEqual(distinctPowers(15), 177, "<code>distinctPowers(15)</code> should return 177.");'
  - text: ''
    testString: 'assert.strictEqual(distinctPowers(20), 324, "<code>distinctPowers(20)</code> should return 324.");'
  - text: ''
    testString: 'assert.strictEqual(distinctPowers(25), 519, "<code>distinctPowers(25)</code> should return 519.");'
  - text: ''
    testString: 'assert.strictEqual(distinctPowers(30), 755, "<code>distinctPowers(30)</code> should return 755.");'

Challenge Seed

function distinctPowers(n) {
  // Good luck!
  return n;
}

distinctPowers(30);

Solution

// solution required