Codeforces 499C:Crazy Town(计算几何)
来源:互联网 发布:淘宝客网站建站 编辑:程序博客网 时间:2024/05/24 03:55
题目链接
给出点A(x1,y1),B(x2,y2),和n条直线(ai,bi,ci,aix + biy + ci = 0),求A到B穿过多少条直线
枚举每条直线判断A、B是否在该直线两侧即可
#include<bits/stdc++.h>using namespace std;#define y1 asodifudouble x1,y1,x2,y2;double a,b,c;double eps=1e-8;bool check(){ if((a*x1+b*y1+c)*(a*x2+b*y2+c)<eps) return true; return false;}int main(){ cin>>x1>>y1>>x2>>y2; int n; cin>>n; int ans=0; while(n--) { cin>>a>>b>>c; if(check()) ans++; } cout<<ans;}
阅读全文
0 0
- Codeforces 499C:Crazy Town(计算几何)
- Codeforces #284 C. Crazy Town 几何
- CodeForces 499C、Crazy Town
- CodeForces 498A-Crazy Town-简单计算几何
- Codeforces Round #284 (Div. 2) C. Crazy Town ACM解题报告(几何)
- Codeforces Round #284 (Div. 2) C. Crazy Town
- Codeforces Round #284 (Div. 2) C. Crazy Town
- Codeforces Round #284 (Div. 2) C. Crazy Town 数学
- Codeforces Round #284 (Div. 2) C. Crazy Town
- codeforces 498A crazy town
- codeforces 498 A Crazy Town
- [CodeForces498A]Crazy Town[几何][附简略证明]
- CodeForces 618 C. Constellation(计算几何)
- CodeForces 1C(计算几何)
- codeforces 1C 计算几何
- CodeForces 498A Round #284 div1A(div2C) Crazy Town
- Codeforces Round #284 (Div. 1) A - Crazy Town
- Codeforces 703C Chris and Road(计算几何)
- 怎样进行可行性研究?
- Window安装Nginx并设置为开机启动
- Android Path相关APIs
- 加密篇
- 唯一一道IO题
- Codeforces 499C:Crazy Town(计算几何)
- 训练日记-22
- 【基础知识整理】什么是启发式?
- What is d_type and why Docker overlayfs need it
- Linux中常用操作命令
- scala-2
- OPENGL—错误调试—无法解析外部符号
- Mahout安装与配置
- B