freeCodeCamp/problem-160-factorial-trailing-digits.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

886 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f40d1000cf542c50ff1f	5	false	Problem 160: Factorial trailing digits	301794

Description

For any N, let f(N) be the last five digits before the trailing zeroes in N!. For example, 9! = 362880 so f(9)=36288 10! = 3628800 so f(10)=36288 20! = 2432902008176640000 so f(20)=17664 Find f(1,000,000,000,000)

Instructions

Tests

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

Challenge Seed

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

euler160();

Solution

// solution required

886 B Raw Blame History