When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

tttt4444's blog

By tttt4444, history, 2 years ago, In English

You are given a set of points with their integer coordinates. You need to determine if there are convex quarilaterals in at most O(n^2) time.

For example: 5 2 2 5 3 8 2 7 6 4 7 Has

5 2 2 7 6 7 4 9 4 10 4 Has not

Thank you for your help!

  • Vote: I like it
  • -1
  • Vote: I do not like it

| Write comment?
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Check if there i s a conv ex quadrilateral from a given set of points