freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.spanish.md

id, localeTitle, challengeType, title

id	localeTitle	challengeType	title
5	5900f40d1000cf542c50ff1f	5	Problem 160: Factorial trailing digits

Description

Para cualquier N, sea f (N) los últimos cinco dígitos antes de los ceros finales en N !. Por ejemplo, 9! = 362880 entonces f (9) = 36288 10! = 3628800 entonces f (10) = 36288 20! = 2432902008176640000 entonces f (20) = 17664 Encuentre f (1,000,000,000,000)

Instructions

Tests

tests:
  - text: <code>euler160()</code> debe devolver 16576.
    testString: 'assert.strictEqual(euler160(), 16576, "<code>euler160()</code> should return 16576.");'

Challenge Seed

function euler160() {
  // Good luck!
  return true;
}

euler160();

Solution

// solution required