hdoj1086

判断一堆线段的交点个数。利用叉积。代码如下。

// hdu1086.cpp : 定义控制台应用程序的入口点。
// Accepted

#include "stdafx.h"
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>

using namespace std;

class Point {
	friend bool check_cross(const Point& p1, const Point& p2);
private:
	double x1, y1, x2, y2;
public:
	Point(double a, double b, double c, double d) :x1(a), y1(b), x2(c), y2(d) {}
};

//线段叉积
bool check_cross(const Point& a, const Point& b)
{
	if (((a.x1 - b.x1)*(a.y2 - b.y1) - (a.x2 - b.x1)*(a.y1 - b.y1))*((a.x1 - b.x2)*(a.y2 - b.y2) - (a.x2 - b.x2)*(a.y1 - b.y2))>0)
		return false;
	if (((b.x1 - a.x1)*(b.y2 - a.y1) - (b.x2 - a.x1)*(b.y1 - a.y1))*((b.x1 - a.x2)*(b.y2 - a.y2) - (b.x2 - a.x2)*(b.y1 - a.y2))>0)
		return false;
	return true;
}

int main()
{
	int N;
	vector<Point> p;
	double a, b, c, d;
	while (cin >> N&&N)
	{
		while (N--)
		{
			cin >> a >> b >> c >> d;
			p.push_back(Point(a, b, c, d));
		}

		int ans = 0;
		for (int i = 0; i < p.size(); i++)
			for (int j = i + 1; j < p.size(); j++)
				if (check_cross(p[i], p[j]))
					ans++;
		cout << ans << endl;
		p.clear();
	}
	system("pause");
	return 0;
}