ACM (TJU) : 1065


#include <stdio.h>
#include <math.h>

int main ()
{
    int testCase;
    scanf ("%d", &testCase);

    while ( testCase-- ) {
        int n;
        scanf ("%d", &n);

        int k = 0;
        while ( pow (5, k) <= n )
            k++;

        int res = 0;
        for ( int i = 1; i < k; i++ )
            res += floor ( n / pow (5, i));

        printf ("%d\n", res);
    }

    return 0;
}

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