1052. Rabbit Hunt

1052. Rabbit Hunt

Time Limit: 1.0 second
Memory Limit: 16 MB
A good hunter kills two rabbits with one shot. Of course, it can be easily done since for any two points we can always draw a line containing the both. But killing three or more rabbits in one shot is much more difficult task. To be the best hunter in the world one should be able to kill the maximal possible number of rabbits. Assume that rabbit is a point on the plane with integer  xand  y coordinates. Having a set of rabbits you are to find the largest number of rabbits that can be killed with single shot, i.e. maximum number of points lying exactly on the same line. No two rabbits sit at one point.

Input

An input contains an integer  N (3 ≤  N ≤ 200) specifying the number of rabbits. Each of the next N lines in the input contains the  x coordinate and the  y coordinate (in this order) separated by a space (−2000 ≤  xy ≤ 2000).

Output

The output contains the maximal number of rabbits situated in one line.

Sample

input output
6
7 122
8 139
9 156
10 173
11 190
-100 1
5

能用乘,尽量yong

#include <iostream>
using namespace std;

int main()
{
	int i, j, k, max = 0, n, num;
	int x[200], y[200];
	cin>>n;
	for (i=0; i<n; i++)
		cin>>x[i]>>y[i];
	for (i=0; i<n-1; i++)
	{
		for (j=i+1; j<n-1; j++)
		{
			num = 2;
			for (k=j+1; k<n; k++)
				if ((x[k]-x[i])*(y[j]-y[i]) == (x[j]-x[i])*(y[k]-y[i]))
					num++;
			if (max < num)
				max = num;
		}
	}
	cout<<max<<endl;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值