计算几何

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
#include <deque>

using namespace std;

const double eps = 1e-8;
const double pi = acos(-1.0);
const int maxn = 100;

//判断数的符号
int cmp(double x)
{
	if (fabs(x) < eps) return 0;
	if (x > 0) return 1;
	return -1;
}

//计算数的平方
inline double sqr(double x)
{
	return x * x;
}

//二维点类
struct point {
	double x, y;
	point() {}
	point(double a, double b): x(a), y(b) {}
	void input() {
		scanf("%lf%lf", &x, &y);
	}
	friend point operator + (const point &a, const point &b) {
		return point(a.x + b.x, a.y + b.y);
	}
	friend point operator - (const point &a, const point &b) {
		return point(a.x - b.x, a.y - b.y);
	}
	friend bool operator == (const point &a, const point &b) {
		return cmp(a.x - b.x) == 0 && cmp(a.y - b.y) == 0;
	}
	friend point operator * (const point &a, const double &b) {
		return point(a.x * b, a.y * b);
	}
	friend point operator * (const double &a, const point &b) {
		return point(a * b.x, a * b.y);
	}
	friend point operator / (const point &a, const double &b) {
		return point(a.x / b, a.y / b);
	}
	double norm() {
		return sqrt(sqr(x) + sqr(y));
	}
};

//向量叉积
double det(const point &a, const point &b) 
{
	return a.x * b.y - a.y * b.x;
}
//向量点积
double dot(const point &a, const point &b)
{
	return a.x * b.x + a.y * b.y;
}
//两点之间距离
double dist(const point &a, const point &b) 
{
	return (a - b).norm();
}
//绕原点逆时针旋转A弧度
point rotate_point(const point &p, double A) 
{
	double tx = p.x, ty = p.y;
	return point(tx * cos(A) - ty * sin(A), tx * sin(A) + ty * cos(A));
}
//线段类
struct line {
	point a, b;
	line() {}
	line(point x, point y): a(x), b(y) {}
};
line point_make_line(const point a, const point b) 
{
	return line(a, b);
}
//计算p点到线段st的距离
double dis_point_segment(const point p, const point s, const point t)
{
	if (cmp(dot(p - s, t - s) < 0)) return (p - s).norm();
	if (cmp(dot(p - t, s - t) < 0)) return (p - t).norm();
	return fabs(det(s - p, t - p) / dist(s, t));
}
//计算p点到线段st的垂足，保存在cp中
void PointProLine(const point p, const point s, const point t, point &cp)
{
	double r = dot((t - s), (p - s)) / dot(t - s, t - s);
	cp = s + r * (t - s);
}
//判断p是否在线段st上
bool PointOnSegment(point p, point s, point t)
{
	return cmp(det(p - s, t - s)) == 0 && cmp(dot(p - s, p - t)) <= 0;
}
//判断a和b是否平行
bool parallel(line a, line b) 
{
	return !cmp(det(a.a - a.b, b.a - b.b));
}
//判断a和b是否相交， 相交返回true且交点保存在res中
bool line_make_point(line a, line b, point &res)
{
	if (parallel(a, b)) return false;
	double s1 = det(a.a - b.a, b.b - b.a);
	double s2 = det(a.b - b.a, b.b - b.a);
	res = (s1 * a.b - s2 * a.a) / (s1 - s2);
	return true;
}
//将直线a沿法向量平移距离len得到的直线
line move_d(line a, const double &len)
{
	point d = a.b - a.a;
	d = d / d.norm();
	d = rotate_point(d, pi / 2);
	return line(a.a + d * len, a.b + d * len);
}
//多边形类
struct polygon {
	int n;
	point a[maxn];
	polygon() {}
	double perimeter() { //计算周长
		double sum = 0.0;
		a[n] = a[0];
		for (int i = 0; i < n; ++i) sum += (a[i + 1] - a[i]).norm();
		return sum;
	}
	double area() { //计算面积
		double sum = 0.0;
		a[n] = a[0];
		for (int i = 0; i < n; ++i) sum += det(a[i + 1], a[i]);
		return sum / 2.0;
	}
	//判断点是否在多边形内
	int Point_In(point t) {
		int num = 0, d1, d2, k;
		a[n] = a[0];
		for (int i = 0; i < n; ++i) {
			if (PointOnSegment(t, a[i], a[i + 1])) return 2;
			k = cmp(det(a[i + 1] - a[i], t - a[i]));
			d1 = cmp(a[i].y - t.y);
			d2 = cmp(a[i + 1].y - t.y);
			if (k > 0 && d1 <= 0 && d2 > 0) ++num;
			if (k < 0 && d2 <= 0 && d1 > 0) --num;
		}
		return num != 0;
	}
};

int main()
{
	return 0;
}