#C7442. Total Road Segments Length
Total Road Segments Length
Total Road Segments Length
You are given n road segments. Each road segment is represented by the coordinates of its two endpoints, (x1, y1) and (x2, y2).
Your task is to compute the total length of these road segments. The length of a single segment is calculated using the Euclidean distance:
\( d = \sqrt{(x_2-x_1)^2+(y_2-y_1)^2} \)
Output the total length rounded to 6 decimal places.
Note: Your program should read input from standard input and write the result to standard output.
inputFormat
The first line contains an integer n representing the number of road segments.
The next n lines each contain four integers x1, y1, x2, y2 separated by spaces, which represent the coordinates of the endpoints of each road segment.
outputFormat
Output a single line containing the total length of all road segments, formatted to 6 decimal places.
## sample3
0 0 3 4
1 2 4 6
3 3 6 7
15.000000