25034번 - convex4gon 다국어언어 제한함수 구현

문제

There is a point set of $n$ distinct points on the $xy$-plane. (0ドル<n<30$) Every $x$- and $y$-coordinate is an integer whose absolute value is less than 1000ドル$. No three distinct points from the point set lie on the same line. We want to count the number of the distinct convex quadrilaterals whose vertices are from the point set.

Write a function convex4gon:

• input parameter: a list-type object L of length $n$ representing the point set
  • Each item of L represents a point from the point set, as a tuple of its $x$- and $y$-coordinates.
  • Each item of L is a tuple-type object of length 2 whose items are int-type objects.
• return value: the int-type object representing the number of the distinct convex quadrilaterals whose vertices are from the point set

입력

출력

제한

힌트

첨부

• T_convex4gon.py