Write the program in python The Giants, for their fun day, competed in a “dashing” competition where each Giant would dash from one point on a grid-patterned dashing surface to another point on the surface, in the dashing time of 2 minutes. The winner of the competition was the one who dashed the farthest in that 2-minute dashing time. You are given two lists (which can be coded directly into your program) one called names with the names of each of the 15 Giants who participated in the dashing, and an associated two-dimensional list/table called startAndEndPoints with 15 rows and 4 columns which stores 4 values for each Giant in a row; two for the starting point (x1, y1) and two for the ending point (x2, y2) of their dash. The first column holds the values for x1, second column holds the value for y1, third column holds the value for x2 and the fourth column holds the value for y2. Each row corresponds to a named dasher in the names list, in the same order. Write a Python program, in a file called dashing.py, to generate a third list called distanceCovered which holds the distance between two points (assuming each Giant dashed in a straight line from the start point to the end point) for each Giant, and find and output the name and the distance covered by the winner of the dashing race, and also the average distance covered by all Giants, with appropriate descriptive labels. The formula to compute the distance between two points (x1, y1 and x2, y2) is: ? = √(?2 − ?1)2 + (?2 − ?1)2 Note: The only built-in functions you are permitted to use in your program are len(), range(), math.sqrt(),math.pow(),append(),andprint(). Youarealsopermittedtomakeanduseyour own functions.
Write the program in python
The Giants, for their fun day, competed in a “dashing” competition where each Giant would dash from one point on a grid-patterned dashing surface to another point on the surface, in the dashing time of 2 minutes. The winner of the competition was the one who dashed the farthest in that 2-minute dashing time.
You are given two lists (which can be coded directly into your program)
-
one called names with the names of each of the 15 Giants who participated in the dashing, and
-
an associated two-dimensional list/table called startAndEndPoints with 15 rows and 4 columns
which stores 4 values for each Giant in a row; two for the starting point (x1, y1) and two for the ending point (x2, y2) of their dash. The first column holds the values for x1, second column holds the value for y1, third column holds the value for x2 and the fourth column holds the value for y2. Each row corresponds to a named dasher in the names list, in the same order.
Write a Python program, in a file called dashing.py, to generate a third list called distanceCovered which holds the distance between two points (assuming each Giant dashed in a straight line from the start point to the end point) for each Giant, and find and output the name and the distance covered by the winner of the dashing race, and also the average distance covered by all Giants, with appropriate descriptive labels.
The formula to compute the distance between two points (x1, y1 and x2, y2) is:
? = √(?2 − ?1)2 + (?2 − ?1)2
Note: The only built-in functions you are permitted to use in your program are len(), range(), math.sqrt(),math.pow(),append(),andprint(). Youarealsopermittedtomakeanduseyour own functions.
Step by step
Solved in 3 steps with 2 images
