zoukankan      html  css  js  c++  java
  • HDU 1086

    You can Solve a Geometry Problem too

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 11918    Accepted Submission(s): 5908


    Problem Description
    Many geometry(几何)problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this final exam. According to the experience of many ACMers, geometry problems are always much trouble, but this problem is very easy, after all we are now attending an exam, not a contest :)
    Give you N (1<=N<=100) segments(线段), please output the number of all intersections(交点). You should count repeatedly if M (M>2) segments intersect at the same point.

    Note:
    You can assume that two segments would not intersect at more than one point.
     

    Input
    Input contains multiple test cases. Each test case contains a integer N (1=N<=100) in a line first, and then N lines follow. Each line describes one segment with four float values x1, y1, x2, y2 which are coordinates of the segment’s ending.
    A test case starting with 0 terminates the input and this test case is not to be processed.
     

    Output
    For each case, print the number of intersections, and one line one case.
     

    Sample Input
    2 0.00 0.00 1.00 1.00 0.00 1.00 1.00 0.00 3 0.00 0.00 1.00 1.00 0.00 1.00 1.00 0.000 0.00 0.00 1.00 0.00 0
     

    Sample Output
    1 3
    题目大意是求线段的交点个数,话不多说,直接上代码!. ``` #include using namespace std; const double eps=1e-10; struct Point { double x,y; }; struct Points { Point s,e; } num[128]; 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() { int i,j,N,sum; while(~scanf("%d",&N)&&N) { for(i=sum=0; i=0; --j) if(inter(num[i].s,num[i].e,num[j].s,num[j].e)) sum++; } printf("%d ",sum); } return 0; } ```
  • 相关阅读:
    npm install命令请求制品库地址的说明
    左merge,右cherry-pick
    Spring validation中自定义的校验错误提示信息如何支持国际化
    IntelliJ IDEA中新增properties文件
    RequestFacade对象获取请求头时忽略大小写
    MongoDB高可用架构集群管理(一)
    MongoDB的备份和恢复
    Postman使用tv4进行JSON Schema结构验证和断言
    Postman中的全局/环境/集合变量的使用及优先级
    在Postman脚本中发送请求(pm.sendRequest)
  • 原文地址:https://www.cnblogs.com/wang-song/p/8588757.html
Copyright © 2011-2022 走看看