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

求大侠拯救

Posted by xinxinghe at 2011-07-12 12:40:46
Fool‘s Day,submit好几次了,每次都WA,源代码如下,希望好心的大侠拯救下小弟。
#include<stdio.h>
#include<math.h>
int main()
{
	int n,i,j,a[1000][6];
	double m1,n1;
	double k0,k1;
	scanf("%d",&n);
	for(j=0;j<n;j++)
		for(i=0;i<6;i++)
			scanf("%d",&a[j][i]);
	for(j=0;j<n;j++)
	{
		//if(a[j][0]+a[j][1]>a[j][2]&&a[j][0]+a[j][2]>a[j][1]&&a[j][1]+a[j][2]>a[j][0])
		//{
			m1=(double)(a[j][0]*a[j][0]+a[j][1]*a[j][1]-a[j][2]*a[j][2])/(2*a[j][0]*a[j][1]);
			n1=(double)(a[j][3]*a[j][3]+a[j][4]*a[j][4]-a[j][5]*a[j][5])/(2*a[j][3]*a[j][4]);
			k0=sqrt(2*(a[j][0]*a[j][0]+a[j][1]*a[j][1])-a[j][2]*a[j][2]);
			k1=sqrt(2*(a[j][3]*a[j][3]+a[j][4]*a[j][4])-a[j][5]*a[j][5]);
			//printf("%lf\n",m1);
			//printf("%lf\n",n1);
			//printf("%lf\n",k0);
			//printf("%lf\n",k1);
			if(m1*n1>0)
			{
				if((m1-n1>=0.000001&&a[j][2]>=a[j][5])||(m1-n1<=0.000001&&k0>=k1))printf("Yes\n");
				else
					printf("No\n");
			}
			if(m1*n1<0)
			{
				if((m1+n1>=0.00001&&a[j][2]>=k1)||(m1+n1<=0.00001&&k0>=a[j][5]))printf("Yes\n");
				else
					printf("No\n");
			}
			if(m1*n1==0)
			{
				if((m1==0&&((n1>=0&&a[j][2]>=k1)||(n1<0&&a[j][2]>=a[j][5])))||(n1==0&&((m1>=0&&a[j][2]>=k1)||(m1<0&&k0>=a[j][5]))))
					printf("Yes\n");
				//if(n1==0&&((m1>=0&&a[j][2]>k1)||(m1<0&&k0>a[j][5])))printf("Yes\n");
				else
					printf("No\n");
			}
		//}
		//else
		//	printf("Error\n");
	}
}

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