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
void print(int x,int y)
ReplyDelete{
int i =x;
LABEL:
printf("%d\n",i++);
if(i>y)
return;
else
goto LABEL;
}
#include
ReplyDeleteusing namespace std;
void print_100(int n)
{
if(n<0)
return;
print_100(n-1);
cout<<n;
}
int main()
{
print_100(100);
return 0;
}
@ankit yes it will work fine..:)
ReplyDelete