counting monotonic paths
find a linear solution for possible number of paths for n=k.
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
catalan numbers :)
ReplyDeleteCan u plz explain the logic or give certain links to understand that? It will be very helpful.
ReplyDelete@saurabh you can read about catalan numbers
ReplyDeletehttp://en.wikipedia.org/wiki/Catalan_number
he nth Catalan number is given directly in terms of binomial coefficients by
ReplyDeletec(n) = (2n)!/(n+1)! * n!