#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
using namespace std;
int n;
struct point
{
double x;
double y;
};
struct v
{
point s;
point e;
} q[102];
int sum;
double multi(struct point p1,struct point p2,struct point p0)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
int main()
{
while(scanf("%d",&n)!=EOF&&n!=0)
{
sum=0;
for(int i=0; i<n; i++)
{
scanf("%lf%lf%lf%lf",&q[i].s.x,&q[i].s.y,&q[i].e.x,&q[i].e.y);
}
for(int i=0; i<n; i++)
{
for(int j=i+1; j<n; j++)
{
if(max(q[i].s.x,q[i].e.x)>=min(q[j].s.x,q[j].e.x)&&
min(q[i].s.x,q[i].e.x)<=max(q[j].s.x,q[j].e.x)&&
max(q[i].s.y,q[i].e.y)>=min(q[j].s.y,q[j].e.y)&&
min(q[i].s.y,q[i].e.y)<=max(q[j].s.y,q[j].e.y)&&
multi(q[j].s,q[i].e,q[i].s)*multi(q[i].e,q[j].e,q[i].s)>=0&&
multi(q[i].s,q[j].e,q[j].s)*multi(q[j].e,q[i].e,q[j].s)>=0)
sum++;
}
}
cout<<sum<<endl;
}
return 0;
}
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
- 20.
- 21.
- 22.
- 23.
- 24.
- 25.
- 26.
- 27.
- 28.
- 29.
- 30.
- 31.
- 32.
- 33.
- 34.
- 35.
- 36.
- 37.
- 38.
- 39.
- 40.
- 41.
- 42.
- 43.
- 44.
- 45.
- 46.
- 47.
- 48.