1) Must use COMMAND PROMPT as program I/O 2) The input file CAN NOT BE \"hard co
ID: 3544873 • Letter: 1
Question
1) Must use COMMAND PROMPT as program I/O
2) The input file CAN NOT BE "hard coded in" NOT ALLOWED: fin = fopen("filename.in", "r");
3) CAN NOT USE fscaf OR fprintf You May Use scanf OR printf
Sample Input:
=================================================
2 25
19 19 32 10
6 45 133 19
5 10
10 20 45 3
30 10 135 4
100 100 219 5
10 100 301 4
30 30 5 3
0 0
=================================================
Sample Output:
=================================================
12.62
12.54
=================================================
The Question:
The Problem:
Given your initial position and speed, as well as the initial positions, speeds and fleeing directions of all of the robbers, determine the minimum amount of time it will take to catch all of them.
The Input:
There will be several robberies to solve. Each robbery begins with two integers, N and C, separated by a space, denoting the number of robbers (1 ? N ? 8) and the speed of the cop (0 < C ? 1000) in units/sec, respectively.
Each of the next N lines will have four space-separated integers, X, Y, D and S. (X, Y) will representing the initial position of that particular robber at time t = 0 (-1000 ? X, Y ? 1000), D represents the direction of movement in degrees (0 degrees is the positive X axis, 90 degrees is the positive Y axis), and S (0 ? S < C) is the speed of that robber in units/sec. It is assumed that all robbers start moving immediately at time t = 0.
The input will end with a line with two 0s.
The Output:
For each test case, output a single real number on its own line, representing the least amount of time needed for the cop to catch all of the robbers. Print this number to exactly 2 decimal places, rounded. Do not output any extra spaces and don
Explanation / Answer
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.