Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

受不了了,谁帮看看WA吧。。(内详)

Posted by Judas at 2005-09-10 07:36:20 on Problem 2606
#include<iostream.h>

int main()
{
	long n,x[200],y[200],flag;
	int i,j,k,max=0,num=2;	
	long a,b;
	cin>>n;	if(2==n)	{cout<<2<<endl;return 0;}
	flag=n/2;
	for(i=0;i<n;i++)	cin>>x[i]>>y[i];

	for(j=0;j<n-1;j++)
	{
		num=2;
		for(k=j+1;k<n;k++)
		{
			//if(k==j)	continue;
			a=x[j]-x[k];b=y[j]-y[k];
			for(i=0;i<n;i++)
			{
				if(i==j||i==k)	continue;
				if(a*(y[j]-y[i])==b*(x[j]-x[i]) )	num++;
			}
			if(num>flag)	{cout<<num<<endl;return 0;}
			if(max<num)	max=num;
		}
	}
	cout<<max<<endl;
	return 0;
}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator