GAMES  HOW MANY GAMES
Problem Statement:
A player has played unknown number of games. We know the average score of the player (sum of scores in all the games / no. of games). Find the minimum number of games the player should have played to achieve that average.
The player can score any nonnegative integer score in a game.
Input:
The first line consists of an integer t, the number of test cases. Each test case consists of a single Rational Number which represents the average score of the player.
Output:
For each test case, find the minimum number of matches the player should have played to achieve that average.
Input Constraints:
1<=t<=1000
1<=avg<=1000000 (maximum 4 digits after the decimal place)
Example:
Sample Input:
3
5
5.5
30.25
Sample Output:
1
2
4
Added by:  cegprakash 
Date:  20121012 
Time limit:  0.185s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All 
hide comments
kshitij_kohli:
20150724 02:23:03
Why is this giving a wrong answer? I have checked all the testcases I could come across, and it seems to be working fine.


ASHUTOSH DWIVEDI:
20150711 21:15:50
WA using input as double


karthik1997:
20150707 20:00:11
ac in 2 nd go .just


Sandeep N Menon:
20150623 17:49:40
python giving TLE 

Bhuvnesh Jain:
20150613 16:19:21
to avoid floating point errors use int and char...


:.Mohib.::
20150612 17:27:39
Nice que!! 

shan_:
20150605 12:26:22
Solved it using strings.


aloo:
20150515 09:53:28
why is using double giving WA??


Siddharth Shah:
20150512 19:57:57
can anyone give me few boundary cases. Giving me WA but all answers for boundary cases mentioned in comments are matching :( 

Ankit Sultana:
20150228 06:05:35
Can be done without strings per se 