Sphere Online Judge

SPOJ Problem Set (classical)

12448. HOW MANY GAMES

Problem code: 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 non-negative 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:2012-10-12
Time limit:1s
Source limit:50000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All

hide comments
2014-08-03 18:37:29 Bodh Almast
any tricky test case?
i tried
999999.9999 -> 1000
2014-07-13 06:14:40 kiran pilli
learnt a new thing..nice problem
2014-07-12 23:12:51 ήάέέϻ
nice and easy :) good question :)
2014-07-07 18:36:17 pandu ranga rao
Constraints helped me... nice one
2014-07-02 09:35:53 Mayank
learned a lot about conversions but AC using strings ,nice problem.
2014-06-26 03:46:44 B Soma Naik
learnt something new../
2014-06-20 16:48:18 Ravi Shankar Mondal
piece of cake using string

Last edit: 2014-06-20 16:50:45
2014-06-19 14:11:11 Saurabh Jaiswal
not able to solve first time !!
but solve after a month .... :)
2014-04-05 09:08:09 shinchan
getting TLE...any suggestions to correct it??
2014-03-31 08:45:17 nitesh kumar
think simple..
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.