Trailing zeros in n factorial.

Write an algorithm which computes the number of trailing zeros in n factorial.

C++:
int TrailingZero(int n)
{
   int count=0;
   while(n){
       n=n/5;
       count+=n;
   }
   return count;
}
Advertisements
This entry was posted in Number trick. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s