F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

The Biggest Convex Hall

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 314    Accepted Submission(s): 36


Problem Description
If you are fond of ACM , you must have know the word ¡°Convex Hall ¡± . which can forms a convex polygon .
Now we define the size of a convex hall as the number of edges it contains .
Give you several points , you can choose some points to form a Convex Hall .Can you tell me the biggest size of convex hall you may find?
What¡¯s more , the convex hall must contains the point (0,0).
 

Input
Each test case will contains an integer n (2<= n<= 100 ), which stands for the number of points you are given besides (0,0).
Then n lines follow. Each line contains two integers x and y ( 0<=x, y <=100) , mean the coordinate of the point .
You may suppose you can at least find a convex hall with 3 edges.
 

Output
For each case, output the biggest size of convex hall in one line.
 

Sample Input
4 0 1 1 0 0 2 2 0
 

Sample Output
3
 

Author
dandelion
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 20:50:35, Gzip enabled