裸的线段相交判断
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const double EPS=1e-10;
double add(double a,double b){
if(abs(a+b)<EPS*(abs(a)+abs(b)))
return 0;
return a+b;
}
struct P
{
double x,y;
P(){}
P(double x,double y):x(x),y(y){
}
P operator +(P p){
return P(add(x,p.x),add(y,p.y));
}
P operator -(P p){
return P(add(x,-p.x),add(y,-p.y));
}
P operator *(double d){
return P(x*d,y*d);
}
double det(P p){
return add(x*p.y,-y*p.x);
}
double dot(P p){
return add(x*p.x,y*p.y);
}
};
P q[100005],p[100005];
int ans[1000005];
bool judge(int a,int b)
{
if((q[a]-q[b]).det(p[b]-q[b])*(p[a]-q[b]).det(p[b]-q[b])<=EPS && (q[b]-q[a]).det(p[a]-q[a])*(p[b]-q[a]).det(p[a]-q[a])<=EPS)
{
return 1;
}
return 0;
}
int krp[1000000];
int main()
{
int n;
while(~scanf("%d",&n) && n!=0)
{
memset(ans,0,sizeof(ans));
for(int i=0;i<n;i++)
scanf("%lf%lf%lf%lf",&q[i].x,&q[i].y,&p[i].x,&p[i].y);
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
if(judge(i,j))
{
ans[i]=1;
break;
}
}
}
int l=0;
for(int i=0;i<n;i++)
{
if(!ans[i])
{
krp[l++]=i+1;
}
}
printf("Top sticks:");
for(int i=0;i<l;i++)
{
if(i!=l-1)
printf(" %d,",krp[i]);
else
printf(" %d.\n",krp[i]);
}
}
return 0;
}