Pagini recente » Cod sursa (job #2635073) | Cod sursa (job #261819) | Cod sursa (job #1222272) | Cod sursa (job #2678871) | Cod sursa (job #37803)
Cod sursa(job #37803)
#include <stdio.h>
#define MAXN 1024
#define MOD 2000003
typedef struct dreapta { int a, b, c; } dreapta;
typedef struct point { int x, y; } point;
int N, M, res;
dreapta D[MAXN];
point P[MAXN];
short int cnt[MOD];
int F(dreapta d, point p)
{
int t = d.a*p.x+d.b*p.y+d.c;
return t > 0 ? 1 : -1;
}
void solve(void)
{
int i, j, key, sgn;
for(i = 1; i <= M; i++)
{
for(key = 0, j = 1; j <= N; j++)
{
sgn = F(D[j], P[i]);
if(sgn == 1)
key = (key*3+2) % MOD;
else
key = (key*3+1) % MOD;
}
cnt[key]++;
}
for(i = 0; i < MOD; i++)
if(cnt[i])
res++;
}
void read_data(void)
{
int i, j;
scanf("%d %d\n", &N, &M);
for(i = 1; i <= N; i++)
scanf("%d %d %d\n", &D[i].a, &D[i].b, &D[i].c);
for(i = 1; i <= M; i++)
scanf("%d %d\n", &P[i].x, &P[i].y);
}
void write_data(void)
{
printf("%d\n", res);
}
int main(void)
{
freopen("regiuni.in", "rt", stdin);
freopen("regiuni.out", "wt", stdout);
read_data();
solve();
write_data();
return 0;
}