HDUoj1086

最新推荐文章于 2020-03-30 00:46:47 发布

hoffman_n

最新推荐文章于 2020-03-30 00:46:47 发布

阅读量190

点赞数

分类专栏： HDUOJ ACM 文章标签： ACM HDUOJ hdu1086

本文链接：https://blog.csdn.net/hoffman_n/article/details/50320081

版权

HDUOJ 同时被 2 个专栏收录

3 篇文章 0 订阅

订阅专栏

ACM

3 篇文章 0 订阅

订阅专栏

#include<iostream>
using namespace std;

int main()
{
int n;
double index[1001][4];
double x1[2],x2[2] ,y1[2] ,y2[2], d,r;
cin >> n;
while(n != 0)
{
int sum = 0;
for(int i = 1; i <= n; i++)
{
cin >> index[i][0] >> index[i][1] >> index[i][2] >> index[i][3];
}

for(int i=1; i<=n-1; i++)
{
for(int j = i+1; j<=n; j++)
{
x1[0] = index[j][2] - index[i][0];
y1[0] = index[j][3] - index[i][1];
x2[0] = index[j][0] - index[i][0];
y2[0] = index[j][1] - index[i][1];
d = x1[0] * y2[0] - x2[0] * y1[0];
x1[1] = index[j][2] - index[i][2];
y1[1] = index[j][3] - index[i][3];
x2[1] = index[j][0] - index[i][2];
y2[1] = index[j][1] - index[i][3];
r = x1[1] * y2[1] - x2[1] * y1[1];
if(d * r > 0)
continue;
x1[0] = index[i][2] - index[j][0];
y1[0] = index[i][3] - index[j][1];
x2[0] = index[i][0] - index[j][0];
y2[0] = index[i][1] - index[j][1];
d = x1[0] * y2[0] - x2[0] * y1[0];
x1[1] = index[i][2] - index[j][2];
y1[1] = index[i][3] - index[j][3];
x2[1] = index[i][0] - index[j][2];
y2[1] = index[i][1] - index[j][3];
r = x1[1] * y2[1] - x2[1] * y1[1];
if(d * r <= 0)
sum++;
}
}
cout << sum << endl;
cin >> n;
}
return 0;
}