CodeForces 498A Round #284 div1A(div2C) Crazy Town
2014-12-25 02:58
363 查看
/* * 对于每条线,如果两个点分别位于这条线的两侧,则对答案+1。 * 因为一个点要到另一个点,必须要穿过这条线,而每次只能穿过1条线。 * 就是这样。 */ /************************************************************************* > File Name: a.cpp > Author: UnknownCUnknown > Mail: jsnjhcb@icloud.com > Created Time: 四 12/25 00:39:09 2014 ************************************************************************/ #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cctype> #include <vector> #include <map> #include <set> #include <stack> #include <list> #include <string> #include <cstdlib> #include <queue> #include <cmath> #include <climits> using namespace std; int main(){ long long x,y; long long x1,y1; scanf("%lld%lld%lld%lld",&x,&y,&x1,&y1); int n; scanf("%d",&n); long long cnt=0; while(n--){ long long a,b,c; scanf("%lld%lld%lld",&a,&b,&c); if(a*x+b*y+c>0){ if(a*x1+b*y1+c<0) ++cnt; } else { if(a*x1+b*y1+c>0) ++cnt; } } printf("%lld\n",cnt); return 0; }
相关文章推荐
- Codeforces Round #250 Div1A Div2C 437C The Child and Toy 贪心
- codeforces 781A Round #403 Div. 2C
- Codeforces Round #419 (Div. 2) (Codeforces 815B) D. Karen and Test 组合数学
- [Codeforces] Round #352 (Div. 2)
- 【Codeforces Round #402 (Div. 1)】Codeforces 778B Bitwise Formula
- CodeForces - div1 -650D:Zip-line(主席树 占位)
- codeforces div2 round#231 B
- codeforces div2 round#230 D
- Codeforces 432 Div. 2-D-Arpa and a list of numbers(枚举倍数求GCD)
- 思路题 codeforces div2 C Replacement
- [最短路 主席树 Hash] Codeforces 464E #265 (Div. 1) E. The Classic Problem
- 第十四次codeforces竞技结束 #266 Div 2
- Codeforces 238 div2 A. Gravity Flip
- codeforces 294 div2.C
- [Codeforces] Round #436 (Div. 2)
- Codeforces 241 div2题解
- Codeforces 456 div2 A B ***D(思维题) ***E(二分/DFS/数论)
- 【索引】Codeforces RCC 2014 Warmup (Div. 2)
- Codeforces 274 DIV1 C - Riding in a Lift 动态规划
- 字符串k在第li到第ri个字符串中一共出现了几次 后缀数组+线段树 Codeforces Div. 1E. Mike and Friends