GAMES - HOW MANY GAMES
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.
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.
For each test case, find the minimum number of matches the player should have played to achieve that average.
1<=avg<=1000000 (maximum 4 digits after the decimal place)
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: SCM chicken|
Sandeep N Menon:
python giving TLE
to avoid floating point errors use int and char...
Solved it using strings.
why is using double giving WA??
can anyone give me few boundary cases. Giving me WA but all answers for boundary cases mentioned in comments are matching :(
Can be done without strings per se
beware of floating pt errors costed me 1WA
good question and must for beginners :)
very gud questn (y)