LightOJ 1305 Area of a Parallelogram

http://lightoj.com/volume_showproblem.php?problem=1305

1305 - Area of a Parallelogram
Time Limit: 1 second(s)Memory Limit: 32 MB

A parallelogram is a quadrilateral with two pairs of parallel sides. See the picture below:

Fig: a parallelogram

Now you are given the co ordinates of A, B and C, you have to find the coordinates of D and the area of the parallelogram. The orientation of ABCD should be same as in the picture.

Input

Input starts with an integer T (≤ 1000), denoting the number of test cases.

Each case starts with a line containing six integers Ax, Ay, Bx, By, Cx, Cy where (Ax, Ay) denotes the coordinate of A(Bx, By) denotes the coordinate of B and (Cx, Cy) denotes the coordinate of C. Value of any coordinate lies in the range [-1000, 1000]. And you can assume that A, B and C will not be collinear.

Output

For each case, print the case number and three integers where the first two should be the coordinate of D and the third one should be the area of the parallelogram.

Sample Input

Output for Sample Input

3

0 0 10 0 10 10

0 0 10 0 10 -20

-12 -10 21 21 1 40

Case 1: 0 10 100

Case 2: 0 -20 200

Case 3: -32 9 1247

 


PROBLEM SETTER: JANE ALAM JAN

题意:

都看的懂就行!求第四个点的坐标,求平行四边形面积。


思路:

思路多简单,问题是今天下午卡了一下午。

说下 BUG 吧。->  

这样输出到整数位对于 S 之后的是直接省去:

DB SIN4=SIN(COS4);
//		DB d2=dis(x[2],y[2],x[4],y[4]);
 		DB S=SIN4*d14*d34;
		printf("Case %d: %d %d %d\n",kc++,x[4],y[4],(int)S);
改成这样就好了 大笑
<span style="white-space:pre">		</span>DB S=SIN4*d14*d34+<strong><span style="color:#ff0000;">0.5</span></strong>;
		printf("Case %d: %d %d %d\n",kc++,x[4],y[4],(int)S);

大哭 大哭基础,没基础了。


AC Code:

#include<stdio.h>
#include<cstring>
#include<cmath>
#include<algorithm>
#define retrun return
#define mian main
#define ture true
#define AC main()
#define LL long long
#define DB double
using namespace std;
const int MYDD=1103;
const DB PI=acos(-1.0);

DB dis(int x1,int y1,int x2,int y2) {/*两点的距离*/
	return sqrt(((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))*1.0);
}

DB COS(DB x,DB y,DB z) {
	return (x*x+y*y-z*z)/(2.0*x*y);
}

DB SIN(DB x) {
	return sqrt(1-x*x);
}

int AC {
	int t,kc=1;
	scanf("%d",&t);
	while(t--) {
		int x[MYDD],y[MYDD];
		for(int j=1; j<=3; j++)
			scanf("%d%d",&x[j],&y[j]);/*数组初始值出错,对自己也是够了*/
		x[4]=x[3]-x[2]+x[1];
		y[4]=y[3]-y[2]+y[1];
		DB d13=dis(x[1],y[1],x[3],y[3]);
		DB d14=dis(x[1],y[1],x[4],y[4]);
		DB d34=dis(x[4],y[4],x[3],y[3]);
		DB COS4=COS(d14,d34,d13);
		DB SIN4=SIN(COS4);/*繁琐的步骤*/
		DB S=SIN4*d14*d34+0.5;/*注意精度问题*/
		printf("Case %d: %d %d %d\n",kc++,x[4],y[4],(int)S);
	}
	return 0;
}





评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值