2021“MINIEYE杯”中国大学生算法设计超级联赛（7）

最新推荐文章于 2021-10-06 23:51:30 发布

yaoyuebaba

最新推荐文章于 2021-10-06 23:51:30 发布

阅读量112

点赞数

本文链接：https://blog.csdn.net/yaoyuebaba/article/details/119580921

版权

1003
被精度卡了几小时，以后做这种题一定多动笔。。。

#include <bits/stdc++.h>
#define endl "\n"
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const int N = 2e5+10;
const int mod = 1e9;
inline ll rd()
{
    ll x=0,f=1; char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48); ch=getchar();}
    return x*f;
}

void solve()
{
    int k;
    k=rd();
    double ans = 0;
    double x1,y1,x2,y2,x3,y3;
    scanf("%lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3);
    double l = x3-x2, h = y1-y2;
    double t = 1.0;
    t = pow(0.5,k-1);
    ans = l*h/2.0*(4*(k-1)-6*(1-t));
    printf("%.3f\n", double(ans));
}

int main()
{
    int T;
    for(T=rd(); T--;)
        solve();
    return 0;
}