HDU1071【求面积】
来源:互联网 发布:单片机管脚图 编辑:程序博客网 时间:2024/05/19 14:51
The area
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8590 Accepted Submission(s): 6016
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
代码:
/**************************************************************************** ******文件名:HDU1971201507202117**创建人:杜新新**日 期:201507202117 **功能描述:计算抛物线和直线所围成的区域的面积**版 本 :Dev c++ **修改人:杜新新**修改内容:点的坐标(没有读懂题,还以为顶点坐标是第2个,题上说的是第一个。)**日 期:201507202250********************************************************************************** */#include <stdio.h>#include <math.h>int main(){int N;double a1,b1,a2,b2,a3,b3,s1,s2,s;double a,b,c,k,d; scanf("%d",&N);while(N--){scanf("%lf%lf%lf%lf%lf%lf",&a1,&b1,&a2,&b2,&a3,&b3);a=(b2-b1)/((a2-a1)*(a2-a1));b=a*(-2)*a1;c=a*a1*a1+b1;s1=1.0/3*a*(a3*a3*a3-a2*a2*a2)+1.0/2*b*(a3*a3-a2*a2)+c*(a3-a2);//printf("%lf\n",s1);k=(b3-b2)/(a3-a2);b=b2-k*a2;s2=1.0/2*k*(a3*a3-a2*a2)+b*(a3-a2);//printf("%lf\n",s2);s=fabs(s2-s1);printf("%.2lf\n",s);}return 0;}
0 0
- hdu1071 (积分求面积)
- hdu1071(积分求面积)
- HDU1071【求面积】
- The area (hdu1071)积分求面积
- hdu1071(积分求直线和抛物线构成的面积)
- hdu1071(抛物线弓形面积阿基米德算法)
- HDU1071
- HDU1071
- HDU1071
- hdu1071
- hdu1071
- HDU1071
- hdu1071
- HDU1071
- HDU1071
- 求面积
- 求面积
- 求面积
- 初涉android中的回调机制
- How to open a popup window in infopath
- 简单记录
- spring(10) Spring的表达式语言
- HTML入门
- HDU1071【求面积】
- 第一个驱动程序之i2c驱动架构介绍
- 操作外部样式表中的样式
- Hibernate(十一)HQL查询
- 算法导论 第二十三章:最小生成树
- hihocoder #1163 : 博弈游戏·Nim游戏
- spring(11) Spring的生命周期
- [LeetCode]Compare Version Numbers
- 数据结构(一):数据结构的基本概念和算法的时间和空间复杂度