#C6188. Minimum Time to Destination
Minimum Time to Destination
Minimum Time to Destination
You are given three integers: N
(the distance to the destination), v
(the maximum speed per second), and F
(the available fuel). In this problem, fuel consumption is assumed to be one unit per unit distance. Your task is to determine whether it is possible to reach the destination using the available fuel. If it is possible, calculate and output the minimum time required to reach the destination, which is computed as \( \frac{N}{v} \) seconds. If the fuel is insufficient (i.e. \( F < N \)), output "Impossible".
Note: Ensure that you read the input from stdin
and write the output to stdout
. Format any floating-point output to one decimal place.
inputFormat
The input consists of a single line containing three space-separated integers: \(N\), \(v\), and \(F\).
outputFormat
If it is possible to reach the destination, output the minimum time required (formatted with one decimal point). Otherwise, output "Impossible".
## sample10 2 15
5.0