#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct point{
double x,y;
point(double x=0, double y=0): x(x), y(y){}
bool leftOf(point A, point B) {return ((B.x - A.x)*(this -> y - A.y) - (B.y - A.y)*(this -> x - A.x)) > 0;}
};
int main(){
double x1, y1, x2, y2; cin>>x1>>y1>>x2>>y2;
int n; cin>>n;
int cnt = 0;
point house = {x1, y1};
point fcgm = {x2, y2};
while(n--){
double a, b, c; cin>>a>>b>>c;
if(a == 0){
if((-c/b - house.y) < 0 && (-c/b - fcgm.y) > 0 || (-c/b - house.y) > 0 && (-c/b - fcgm.y) < 0) cnt++;
}
else if(b == 0){
if((-c/a - house.x) < 0 && (-c/a - fcgm.x) > 0 || (-c/a - house.x) > 0 && (-c/a - fcgm.x) < 0) cnt++;
}
else{
ll dis1 = (a*x1)+(b*y1)+c;
ll dis2 = (a*x2)+(b*y2)+c;
if((dis1>0 && dis2<0) || (dis1<0 && dis2>0)) cnt++;
}
}
cout<<cnt<<endl;
}
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |