hdu1071 The area
来源:互联网 发布:java中如何处理高并发 编辑:程序博客网 时间:2024/05/14 13:53
The area
Problem Description
Ignatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area. Now given all the intersectant points shows in the picture, can you tell Ignatius the area of the land?
Note: The point P1 in the picture is the vertex of the parabola.
Note: The point P1 in the picture is the vertex of the parabola.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains three intersectant points which shows in the picture, they are given in the order of P1, P2, P3. Each point is described by two floating-point numbers X and Y(0.0<=X,Y<=1000.0).
Each test case contains three intersectant points which shows in the picture, they are given in the order of P1, P2, P3. Each point is described by two floating-point numbers X and Y(0.0<=X,Y<=1000.0).
Output
For each test case, you should output the area of the land, the result should be rounded to 2 decimal places.
Sample Input
25.000000 5.0000000.000000 0.00000010.000000 0.00000010.000000 10.0000001.000000 1.00000014.000000 8.222222
Sample Output
33.3340.69HintFor float may be not accurate enough, please use double instead of float.
Author
Ignatius.L
#include <iostream>#include <cstdio>using namespace std;int t;double x[3],y[3],S,s1,s2;double P(){ double a; a = (y[1] - y[0])/(x[1]-x[0])/(x[1]-x[0]); return s1 = a/3*(x[2]-x[0])*(x[2]-x[0])*(x[2]-x[0])-a/3*(x[1]-x[0])*(x[1]-x[0])*(x[1]-x[0])+(x[2]-x[1])*y[0];}double line(){ return s2 = (y[1]+y[2])*(x[2]-x[1])/2;}int main(){ //freopen("test.txt","r",stdin); int i; cin>>t; while(t--) { for(i=0;i<3;i++) { cin>>x[i]>>y[i]; } S=P()-line(); printf("%.2lf\n",S); } //cout << "Hello world!" << endl; return 0;}
0 0
- HDU1071 The area 【积分】
- Hdu1071 The area
- hdu1071数学题 The area
- hdu1071 The area
- HDU1071 The area
- hdu1071——The area
- The area (hdu1071)积分求面积
- ACM-计算几何之The area——hdu1071
- hdu1071-The area 积分求解与x轴形成的面积
- HDU1071-----The are--- hdu(84)
- HDU1071
- HDU1071
- HDU1071
- hdu1071
- hdu1071
- HDU1071
- hdu1071
- HDU1071
- UVA 536(p177)----Tree Recovery
- 1053. Path of Equal Weight (30)
- leetcode-103-Binary Tree Zigzag Level Order Traversal
- IE8 div 非按钮点击之后,为了防止重复点击,会默认添加[disabled=“disabled”]
- hdu 4283 You Are the One
- hdu1071 The area
- 近200篇机器学习&深度学习资料分享
- hdu 1518 square
- Uva The Tower of Babylon
- Started Service 与 Bound Service
- Cpp_类和对象
- C# 5.0 使用任务调试表TaskScheduler来运行task
- UVA 540(p117)----Team Queue
- 在CentOS上MySQL数据库服务器配置方法