count number of ways from (0,0) to (m,n)
You are given a m*n chess board.you are at lower-most vertex,and you can move one step right or one step above your current co-ordinate.Find out the number of ways to reach point(m,n).
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
if(i==0 || j==0)
ReplyDeletereturn 1;
else return(f(i-1,j)+f(i,j-1));