本文主要是介绍poj 1673 EXOCENTER OF A TRIANGLE，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
垂心。
/** Author: stormdpzh* Created Time: 2012/7/19 15:12:17* File Name: poj_1673.cpp*/
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <functional>#define sz(v) ((int)(v).size())
#define rep(i, n) for(int i = 0; i < n; i++)
#define repf(i, a, b) for(int i = a; i <= b; i++)
#define repd(i, a, b) for(int i = a; i >= b; i--)
#define out(n) printf("%d\n", n)
#define mset(a, b) memset(a, b, sizeof(a))
#define wh(n) while(1 == scanf("%d", &n))
#define whz(n) while(1 == scanf("%d", &n) && n != 0)
#define lint long longusing namespace std;const int MaxN = 1 << 30;struct Point
{double x, y;Point() {}Point(double _x, double _y) : x(_x), y(_y) {}
};Point get_intersection(const Point &p1, const Point &p2, const Point &p3, const Point &p4)
{Point tmp = p1;double t = ((p1.x - p3.x) * (p3.y - p4.y) - (p1.y - p3.y) * (p3.x - p4.x)) / ((p1.x - p2.x) * (p3.y - p4.y) - (p1.y - p2.y) * (p3.x - p4.x));tmp.x += (p2.x - p1.x) * t;tmp.y += (p2.y - p1.y) * t;return tmp;
}double x[5], y[5];
Point p1, p2;void gao()
{double xa = x[0] - y[2] + y[1];double ya = y[0] + x[2] - x[1];double xb = x[1] - y[2] + y[0];double yb = y[1] + x[2] - x[0];Point res = get_intersection(Point(x[0], y[0]), Point(xa, ya), Point(x[1], y[1]), Point(xb, yb));printf("%.4lf %.4lf\n", res.x, res.y);
}int main()
{int t;scanf("%d", &t);while(t--) {rep(i, 3) scanf("%lf%lf", &x[i], &y[i]);gao();}return 0;
}
这篇关于poj 1673 EXOCENTER OF A TRIANGLE的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
