UVA 11437 - Triangle Fun

一道模板题，求三等分点然后求交点，然后用叉积求面积

代码如下：

#include<iostream>
#include<cmath>
#include<iomanip>
#include<cstdio>
using namespace std;
struct Point{
	double x;
	double y;
	Point(double x=0,double y=0):x(x),y(y){}
} ;

typedef Point Vector;

Vector operator + (Vector A,Vector B){return Vector(A.x+B.x,A.y+B.y);}

Vector operator - (Vector a,Vector b){return Vector(a.x-b.x,a.y-b.y);}

Vector operator * (Vector a,double p){return Vector(a.x*p,a.y*p);}

Vector operator / (Vector a,double p){return Vector(a.x/p,a.y/p);}

const double eps = 1e-10;
int dcmp(double x){
	if(fabs(x)<eps)return 0;
	return x<0?-1:1;
}

bool operator == (const Point &a,const Point &b){
	return dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)==0;
}

double Dot(Vector a,Vector b){
	return a.x*b.x+a.y*b.y;
}

double Length(Vector a){return sqrt(Dot(a,a));}
double Length2(Vector a){return Dot(a,a);}

double angle(Vector a,Vector b){return acos(Dot(a,b)/Length(a)/Length(b));}

double Cross(Vector a,Vector b){return a.x*b.y-a.y*b.x;}

Point GetLineIntersection(Point p,Vector v,Point q,Vector w){
	Vector u=p-q;
	double t=Cross(w,u)/Cross(v,w);
	return p+v*t;
}

int main(){
//	freopen("data.txt","r",stdin);
	int n;
	scanf("%d",&n);
	while(n--){
		Point a,b,c;
		scanf("%lf%lf%lf%lf%lf%lf",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y);
		Point d=b+(c-b)/3;
		Point e=c+(a-c)/3;
		Point f=a+(b-a)/3;
		Point p=GetLineIntersection(b,e-b,a,d-a);
		Point q=GetLineIntersection(c,f-c,b,e-b);
		Point r=GetLineIntersection(c,f-c,a,d-a);
		cout<<setiosflags(ios::fixed)<<setprecision(0)<<fabs(Cross(p-q,r-q))/2<<endl;
	}
	return 0;
}