Codeforces Round #284 (Div. 1) A - Crazy Town

很容易看出一条直线能将一个平面分割成两个平面，所以只要计算有多少个点在两个平面之间就可以了。。。

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1000005
#define maxm 2000005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
//head

LL a, b, c, xx1, yy1, xx2, yy2, n;

LL calc(LL x, LL y)
{
	LL res = a * x + b * y + c;
	if(res > 0) return 1;
	else return -1;
}

void read()
{
	scanf("%I64d%I64d%I64d%I64d", &xx1, &yy1, &xx2, &yy2);
	scanf("%I64d", &n);
}

void work()
{
	LL ans = 0;
	for(int i = 1; i <= n; i++) {
		scanf("%I64d%I64d%I64d", &a, &b, &c);
		if(calc(xx1, yy1) * calc(xx2, yy2) < 0) ans++;
	}
	printf("%I64d\n", ans);
}

int main()
{
	read();
	work();
	
	return 0;
}