consecutive sum puzzle
Arrange numbers from 1 to 16 such that the sum of every two consecutive numbers in the arrangement is a perfect square (you can use a number only once).
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
16 9 7 2 14 11 5 4 12 13 3 6 10 15 1 8
ReplyDeleteyes correct..
ReplyDelete