python code and output with screenshot. Do not waste question i will give you multiple downvote. Here are n posts at specific bearings on a plane. It is guaranteed that no three fence posts lie on a comparative line. There are a boundless number of cows on the plane, one at each
Answer in python code and output with screenshot. Do not waste question i will give you multiple downvote.
Here are n posts at specific bearings on a plane. It is guaranteed that no three fence posts lie on a comparative line. There are a boundless number of cows on the plane, one at each point with entire number bearings. Gregor is a person from the Illuminati, and requirements to develop a three-sided fence, interfacing 3 unquestionable existing divider posts. A cow severely inside the fence should be encased. In the event that there are an odd number of encased cows and the space of the fence is an entire number, the fence should be fascinating. Find the amount of charming divider.
Data : The essential line contains the entire number n (3≤n≤6000), the amount of fence posts which Gregor can choose to shape the vertices of a fence.
All of the accompanying n line contains two entire numbers x and y (0≤x,y≤107, x and y are even), where (x,y) is the organize of a fence post. All fence posts lie at unquestionable bearings. No three fence posts are on a comparative line.
Yield: Pint a lone entire number, the amount of interesting divider. Two divider are viewed as exceptional in the event that they are worked with a substitute plan of three fence posts.
Step by step
Solved in 4 steps with 1 images
