freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-48-self-powers.md

id	challengeType	videoUrl	localeTitle
5900f39c1000cf542c50feaf	5		问题48：自我权力

Description

系列，1 ¹ + 2 ² + 3 ³ + ... + 10 ¹⁰ = 10405071317.查找该系列的最后十位数字，1 ¹ + 2 ² + 3 ³ + ... + 1000 ¹⁰⁰⁰ 。

Instructions

Tests

tests:
  - text: '<code>selfPowers(10, 3)</code>应该返回317。'
    testString: assert.strictEqual(selfPowers(10, 3), 317);
  - text: '<code>selfPowers(150, 6)</code>应返回29045。'
    testString: assert.strictEqual(selfPowers(150, 6), 29045);
  - text: '<code>selfPowers(673, 7)</code>应该返回2473989。'
    testString: assert.strictEqual(selfPowers(673, 7), 2473989);
  - text: '<code>selfPowers(1000, 10)</code>应该返回9110846700。'
    testString: assert.strictEqual(selfPowers(1000, 10), 9110846700);

Challenge Seed

function selfPowers(power, lastDigits) {
  // Good luck!
  return true;
}

selfPowers(1000, 10);

Solution

// solution required

/section>