hdu 1086 You can Solve a Geometry Problem too
来源:互联网 发布:大数据的安全管理 编辑:程序博客网 时间:2024/05/16 14:36
判断线段是否相交的模板题:
#include <iostream>using namespace std;struct piont{ double x,y;};struct segm{ piont p1,p2;}s[110];double dir(piont pi,piont pj,piont pk){ return (pi.x - pk.x)*(pj.y - pk.y) - (pj.x - pk.x)*(pi.y - pk.y);}bool onseg(piont pi,piont pj,piont pk){ if((pk.x >= min(pi.x,pj.x)&&pk.x <= max(pi.x,pj.x))&&(pk.y >= min(pi.y,pj.y)&&pk.y <= max(pi.y,pj.y))) return 1; else return 0;}bool seg(piont p1,piont p2,piont p3,piont p4){ double d1,d2,d3,d4; d1 = dir(p3,p4,p1); d2 = dir(p3,p4,p2); d3 = dir(p1,p2,p3); d4 = dir(p1,p2,p4); if(((d1 > 0&&d2 < 0)||(d1 < 0&&d2 > 0))&&((d3 > 0&&d4 < 0)||(d3 < 0&&d4 > 0))) return 1; else if(d1 == 0&&onseg(p3,p4,p1)) return 1; else if(d2 == 0&&onseg(p3,p4,p2)) return 1; else if(d3 == 0&&onseg(p1,p2,p3)) return 1; else if(d2 == 0&&onseg(p1,p2,p4)) return 1; else return 0;}int main(){ int n,i,j,ans; while(cin>>n&&n) { ans = 0; for(i = 0;i < n;i ++) { cin>>s[i].p1.x>>s[i].p1.y>>s[i].p2.x>>s[i].p2.y; } for(i = 0;i < n;i ++) { for(j = i+1;j < n;j ++) { if(seg(s[i].p1,s[i].p2,s[j].p1,s[j].p2)) ans ++; } } cout<<ans <<endl; } return 0;}
- hdu 1086 You can Solve a Geometry Problem too
- hdu 1086 You can Solve a Geometry Problem too
- hdu 1086 You can Solve a Geometry Problem too
- HDU 1086 You can Solve a Geometry Problem too
- hdu 1086 You can Solve a Geometry Problem too
- hdu 1086 You can Solve a Geometry Problem too
- hdu/hdoj 1086 You can Solve a Geometry Problem too
- hdu-1086You can Solve a Geometry Problem too
- HDU 1086 You can Solve a Geometry Problem too
- HDU 1086:You can Solve a Geometry Problem too
- HDU 1086You can Solve a Geometry Problem too
- hdu 1086 You can Solve a Geometry Problem too
- HDU-1086-You can Solve a Geometry Problem too
- HDU 1086 You can Solve a Geometry Problem too
- HDU 1086 You can Solve a Geometry Problem too
- HDU-1086 You can Solve a Geometry Problem too
- HDU-1086-You can Solve a Geometry Problem too
- HDU 1086 You can Solve a Geometry Problem too
- struts2标签的使用!
- 实验报告5-2
- Color Drawable
- ice环境初始化和slice方法调用
- PHP文件去掉PHP注释空格的函数(PHP代码压缩)
- hdu 1086 You can Solve a Geometry Problem too
- 实验报告 5---3
- 2. python 初窥
- 创建桌面图标
- js:单选框选择触发事件
- JSP URL中文传递出现乱码解决
- DZ修改标题字数限制:Discuz X2.0 如何修改帖子标题字数限制
- 五周 三角形类
- 厚度2955