题目:
分析:
叉积裸题
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
#define ch cheap
using namespace std;
inline LL read() {
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
int main()
{
int t=read();
int a,b,c,d,e,f;
while(t--)
{
a=read();b=read();c=read();d=read();e=read();f=read();
double w=(c-a)*(f-b)-(e-a)*(d-b);
if(!w) printf("Error\n");
else printf("%.1lf\n",abs(w));
}
return 0;
}