z-prave
Mr. Little Z is looking at a piece of paper. There are some points on the paper. Mr. Little Z is thinking about how many different straight lines he can draw so every straight line contains at least two points from the paper.
Help Mr. Little Z so he can save some time...
InputThe first line of the standard input contains the number N which represents the number of points on the paper (1 <= N <= 100). The following N lines contain 2 POSITIVE INTEGER numbers representing X and Y coordinates of the point. The point's coordinates are from 0 to 10000. No two points will have the same coordinates.
OutputWrite one number to the standard output that represents the number of different straight lines Mr. Little Z can draw so that every straight line contains at least 2 of the given points.
Input:
Output:
4
1 1
1 2
1 3
2 2Output:
4Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.