You will write three functions. The first finds the multiplier of the plane of a family that passes through a point. The second finds the image of a point in a plane. The third finds the shortest path from one point to another that touches a plane. A plane is stored as for .
The idea. The plane passes through a point when . The image of is . If and are on the same side of the plane, the shortest path has length . If they are on opposite sides, it is .
Your tasks.
family_lambda(plane1, plane2, point).image(point, plane). Return the image as a tuple.bounce_path(A, B, plane). Return the length of the shortest path from to the plane to .Have you tried it?
Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.
Log in to join the discussion.
Loading…