predict o/p
int main()
{
int i =2;
int c = (i!=0)?(i!=1)?(i!=2)?(-2):(-3):(-4):(-5);
printf("%d",c);
return 0;
}
{
int i =2;
int c = (i!=0)?(i!=1)?(i!=2)?(-2):(-3):(-4):(-5);
printf("%d",c);
return 0;
}
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
-3
ReplyDelete