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

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

## Description
<section id="description">系列，1 <sup>1</sup> + 2 <sup>2</sup> + 3 <sup>3</sup> + ... + 10 <sup>10</sup> = 10405071317.查找该系列的最后十位数字，1 <sup>1</sup> + 2 <sup>2</sup> + 3 <sup>3</sup> + ... + 1000 <sup>1000</sup> 。 </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
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);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

selfPowers(1000, 10);

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>