ÀÂÒ
Language: Russian
English

Remote Training on Programming

Problems Online status Contests
News FAQ E-learning
For authors:
Register  ||  Login
 
Hello, Guest! Please login or register.

612. Points

Time Limit: 2 seconds
Memory Limit:65536KB
Points:100
View Problem Statistics Submit Problem added debug

N points are on a plane. You have to find the minimal number of straight lines, so that each point would belong to at least one line. Besides, if you have to use more than one line, then all the lines should be parallel to each other.

Input
In the first line of input file an integer number N is written - number of points on a plane (1 ≤ N ≤ 250). In the next N lines points coordinates are written. All coordinates are integer numbers with absolute value not greater that 106.
Output
Write a single number - the answer to this problem.

Input 1 Output 1 Input 2 Output 2 Input 3 Output 3
3
0 0
2 0
10 0
1
4
0 0
1 0
0 1
1 1
2
4
0 0
1 0
2 1
2 3
3


View Problem Statistics Submit Problem discussion Author/source:
Problems from Contests and Camps / Kovrov contests / KIT-2008 /
608. Math and Soldiers 612. 609. Roads 614. String Multiplication
time generating 0.093 sec.
© Copyright VSU, AVT, Nosov D.A., Andrianov I.A.