【线段相交】（吉大模板）：hdu 1086 You can Solve a Geometry Problem too

解题思路

读取一条线的起点和终点，暴力枚举所有线段，判断两两线段是否相交，调用模板，返回true则ans++，最后输出ans即可。

参考代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <climits>
#define eps 1e-10
using namespace std;
typedef long long ll;
const int INF=INT_MAX;
const int maxn = 110;
int n;
struct point{double x,y;};
bool inter(point a,point b,point c,point d)//判断线段相交（吉大模板）
{
    if(min(a.x,b.x)>max(c.x,d.x)||
       min(a.y,b.y)>max(c.y,d.y)||
       min(c.x,d.x)>max(a.x,b.x)||
       min(c.y,d.y)>max(a.y,b.y) ) return 0;
    double h,i,j,k;
    h=(b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);
    i=(b.x-a.x)*(d.y-a.y)-(b.y-a.y)*(d.x-a.x);
    j=(d.x-c.x)*(a.y-c.y)-(d.y-c.y)*(a.x-c.x);
    k=(d.x-c.x)*(b.y-c.y)-(d.y-c.y)*(b.x-c.x);
    return h*i<=eps&&j*k<=eps;
}
int main()
{
  // freopen("input.txt","r",stdin);
   point a[maxn],b[maxn];
   while(cin>>n&&n){
    for(int i=0;i<n;i++) cin>>a[i].x>>a[i].y>>b[i].x>>b[i].y;
    int ans=0;
    for(int i=0;i<n;i++)  //二重循环两两比较，n<=100
    for(int j=i+1;j<n;j++){
      if(inter(a[i],b[i],a[j],b[j])==true) ans++;
    }
    cout<<ans<<endl;
   }
   return 0;
}