73 lines
1.2 KiB
Markdown
73 lines
1.2 KiB
Markdown
---
|
||
id: 5900f39c1000cf542c50feaf
|
||
title: 问题48：自我权力
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-48-self-powers
|
||
---
|
||
|
||
# --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> 。
|
||
|
||
# --hints--
|
||
|
||
`selfPowers(10, 3)`应该返回317。
|
||
|
||
```js
|
||
assert.strictEqual(selfPowers(10, 3), 317);
|
||
```
|
||
|
||
`selfPowers(150, 6)`应返回29045。
|
||
|
||
```js
|
||
assert.strictEqual(selfPowers(150, 6), 29045);
|
||
```
|
||
|
||
`selfPowers(673, 7)`应该返回2473989。
|
||
|
||
```js
|
||
assert.strictEqual(selfPowers(673, 7), 2473989);
|
||
```
|
||
|
||
`selfPowers(1000, 10)`应该返回9110846700。
|
||
|
||
```js
|
||
assert.strictEqual(selfPowers(1000, 10), 9110846700);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function selfPowers(power, lastDigits) {
|
||
|
||
return true;
|
||
}
|
||
|
||
selfPowers(1000, 10);
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
function selfPowers(power, lastDigits) {
|
||
let sum = 0;
|
||
const modulo = Math.pow(10, lastDigits);
|
||
|
||
for (let i = 1; i <= power; i++) {
|
||
let temp = i;
|
||
for (let j = 1; j < i; j++) {
|
||
temp *= i;
|
||
temp %= modulo;
|
||
}
|
||
|
||
sum += temp;
|
||
sum %= modulo;
|
||
}
|
||
|
||
return sum;
|
||
}
|
||
```
|