HDOJ1071The area
来源:互联网 发布:淘宝卖的舒尔话筒假的 编辑:程序博客网 时间:2024/05/16 00:54
The area
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8669 Accepted Submission(s): 6078
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.69
//类似于定积分 #include<stdio.h>#include<math.h>int main(){double x1,x2,x3,y1,y2,y3,sum;int n;scanf ("%d",&n);while (n--){double a,b,k,t,e=0.01;scanf ("%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3);a=(x2-x1)*(x2-x1);t=(y2-y1)/a;k=(y3-y2)/(x3-x2);b=y3-k*x3;sum=0.0;if (y2>y3){double top=y2;y2=y3;y3=top;}for (double i=x2;i<=x3;i+=e){sum+=(t*(i-x1)*(i-x1)+y1-(k*i+b))*e;}printf ("%.2f\n",sum);}return 0;}
0 0
- HDOJ1071The area
- Area
- Area
- Area
- area
- Area
- Area
- zoj1010 Area
- Controlling Area
- mrp area
- The area
- Arable Area
- ZOJ1010 Area
- Circular Area
- POJ1265 Area
- Area (P1654)
- poj1654 - Area
- HDACM217 area
- [Leetcode]Palindrome Linked List
- 2015-多校-6-1011-Key Set-快次幂
- PHP文件编程
- Android Data Binding代码实践(告别findViewById)(四)
- 最大权闭合子图
- HDOJ1071The area
- 线型表(C++实现顺序表和单链表)
- 批量生成分区脚本
- Mongodb Journaling 机制
- Session的创建和删除
- Max Sum
- hdu 1272 并查集
- 深入了解Looper、Handler、Message之间关系
- Cookie的创建和删除