NBUT-2014暑期集训专题练习1 -> 二分法 A题
来源:互联网 发布:风险矩阵法判断准则 编辑:程序博客网 时间:2024/06/05 14:25
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
就是个数学题,给你三个点,然后求出抛物线和直线的参数,之后积分
这里要注意下,抛物线的系数a是不可为0的,还有这题不用考虑直线斜率无穷的情况
下面的是代码
#include<stdio.h>
#include<string.h>
double x1,y1,x2,y2,x3,y3;
int main()
{
int t;
while(~scanf("%d",&t))
{
while(t--)
{
scanf("%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3);
double a,b,c,k,t;
k=(y3-y2)/(x3-x2);
t=(x3*y2-x2*y3)/(x3-x2);
if(y3!=y2)
a=(y3-y2)/((x3*x3-x2*x2)+2*x1*(x2-x3));
else
a=(y2-y1)/((x1-x2)*(x1-x2));
b=-2*a*x1;
c=y2-a*x2*x2+2*a*x1*x2;
double area=(a*x3*x3*x3/3)-(a*x2*x2*x2/3)+((b-k)*x3*x3/2)-((b-k)*x2*x2/2)+(c-t)*(x3-x2);
printf("%.2f\n",area);
}
}
return 0;
}
0 0
- NBUT-2014暑期集训专题练习1 -> 二分法 A题
- NBUT-2014暑期集训专题练习1 -> 二分法E - E
- NBUT-2014暑期集训专题练习1 -> 二分法 J - J
- NBUT-2014暑期集训专题练习1 -> 二分法 H - H
- NBUT-2014暑期集训专题练习1 -> 二分法B - B
- NBUT-2014暑期集训专题练习1 -> 二分法L - L
- NBUT-2014暑期集训专题练习1 -> 二分法F - F
- NBUT-2014暑期集训专题练习1 -> 二分法 N - N
- 2016暑期集训1A 组合数
- HNUST专题练习:二分法
- 8.2 暑期集训—— 二分法
- 2013.7.19 2013NBUT暑期集训成果赛
- 暑期集训搜索专题(一)
- 暑期集训搜索专题(一)
- 2014暑期集训总结
- 暑期集训 Contest 1
- HPU16级暑期集训练习(一)
- HPU2017-2016级暑期集训练习赛
- pdf在线转换成word官方免费版
- POJ 2777 Count Color
- NOJ [1120] Reimu\'s Teleport
- POJ Maximum sum
- NOJ [1132] Evil Wheel
- NBUT-2014暑期集训专题练习1 -> 二分法 A题
- NBUT-2014暑期集训专题练习1 -> 二分法E - E
- NBUT-2014暑期集训专题练习1 -> 二分法 J - J
- NBUT-2014暑期集训专题练习1 -> 二分法 H - H
- NBUT-2014暑期集训专题练习1 -> 二分法B - B
- NBUT-2014暑期集训专题练习1 -> 二分法L - L
- NBUT-2014暑期集训专题练习1 -> 二分法F - F
- nbut线段树专题E - Just a Hook
- nbut线段树专题F - A Simple Problem with Integers