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

id	title	challengeType	forumTopicId	dashedName
5900f39c1000cf542c50feaf	Problema 48: Elevado à base	5	302157	problem-48-self-powers

--description--

A série, 1¹ + 2² + 3³ + ... + 10¹⁰ = 10405071317.

Encontre os últimos dez dígitos da série, 1¹ + 2² + 3³ + ... + 1000¹⁰⁰⁰.

--hints--

selfPowers(10, 3) deve retornar um número.

assert(typeof selfPowers(10, 3) === 'number');

selfPowers(10, 3) deve retornar 317.

assert.strictEqual(selfPowers(10, 3), 317);

selfPowers(150, 6) deve retornar 29045.

assert.strictEqual(selfPowers(150, 6), 29045);

selfPowers(673, 7) deve retornar 2473989.

assert.strictEqual(selfPowers(673, 7), 2473989);

selfPowers(1000, 10) deve retornar 9110846700.

assert.strictEqual(selfPowers(1000, 10), 9110846700);

--seed--

--seed-contents--

function selfPowers(power, lastDigits) {

  return true;
}

selfPowers(1000, 10);

--solutions--

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;
}