I started solving easy problems in Perl from codechef.com
This is my first solution which got accepted. So, I am sharing with you guys. You can post your solution in Perl or in any programming languages.
Problem
The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and every phone connects to the BTS with the strongest signal (in a little simplified view). Of course, BTSes need some attention and technicians need to check their function periodically.
The technicians faced a very interesting problem recently. Given a set of BTSes to visit, they needed to find the shortest path to visit all of the given points and return back to the central company building. Programmers have spent several months studying this problem but with no results. They were unable to find the solution fast enough. After a long time, one of the programmers found this problem in a conference article. Unfortunately, he found that the problem is so called "Traveling Salesman Problem" and it is very hard to solve. If we have N BTSes to be visited, we can visit them in any order, giving us N! possibilities to examine. The function expressing that number is called factorial and can be computed as a product 1.2.3.4....N. The number is very high even for a relatively small N.
The programmers understood they had no chance to solve the problem. But because they have already received the research grant from the government, they needed to continue with their studies and produce at least some results. So they started to study behavior of the factorial function.
For example, they defined the function Z. For any positive integer N, Z(N) is the number of zeros at the end of the decimal form of number N!. They noticed that this function never decreases. If we have two numbers N_{1}<N_{2}, then Z(N_{1}) <= Z(N_{2}). It is because we can never "lose" any trailing zero by multiplying by any positive number. We can only get new and new zeros. The function Z is very interesting, so we need a computer program that can determine its value efficiently.
Input
There is a single positive integer T on the first line of input (equal to about 100000). It stands for the number of numbers to follow. Then there are T lines, each containing exactly one positive integer number N, 1 <= N <= 1000000000.
Output
For every number N, output a single line containing the single nonnegative integer Z(N).
Example
Sample Input:
6 3 60 100 1024 23456 8735373
Sample Output:
0 14 24 253 5861 2183837
and time limit is 8 seconds. My solution took 2.92 seconds
Solution
Congrts... for first accepted solution..
You can make that a bit fast by removing "while($y/5**$count >= 1 ) & $sum += $y/5**$count " by single variable. Actually you are doing same calculation twice.
One more thing if we are using CPP and program takes large number of input and output than it is better to go with printf & scanf instead of cin & cout.
No as per my knowledge execution time does not depend on the internet connection.
Here this my CPP code which got accepted in 0.32sec.
#include <cstdio>

Hi Abhishek,
I observed that after submitting the code. But you know I changed the code and submitted again.
This time time limit got exceeded.
Does its output depend upon the internet connection also?
I just changed few lines
previous lines
while($y/5**$count){
sum+=$y/5**$count;
modified lines
$factor = 5**$count;
while($y/$factor >= 1 )
{
$sum += $y/$factor;
Follow us at :
Facebook  Twitter
########### Give me the right place to stand, I shall move the earth. #################