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

id	challengeType	title	videoUrl	localeTitle
5900f40d1000cf542c50ff1f	5	Problem 160: Factorial trailing digits		Problema 160: Dígitos Fatoriais

Description

Para qualquer N, seja f (N) os últimos cinco dígitos antes dos zeros à direita em N !. Por exemplo, 9! = 362880 f (9) = 36288 10! = 3628800 f (10) = 36288 20! = 2432902008176640000 so f (20) = 17664 Encontre f (1.000.000.000.000)

Instructions

Tests

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

Challenge Seed

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

euler160();

Solution

// solution required