Pagini recente » Cod sursa (job #2380864) | Cod sursa (job #2954906) | Cod sursa (job #1509314) | Cod sursa (job #674214) | Cod sursa (job #1294620)
#include <cstdio>
#include <vector>
#define NMAX 1001
#define Mod 666013
using namespace std;
int n, m;
int a[NMAX], b[NMAX], c[NMAX];
bool Ap[Mod];
int Num;
int main(){
freopen("regiuni.in", "r", stdin);
freopen("regiuni.out", "w", stdout);
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; ++i)
scanf("%d %d %d\n", &a[i], &b[i], &c[i]);
for(int i = 1; i <= m; ++i){
int A, B, Ans = 0;
scanf("%d %d\n", &A, &B);
for(int k = 1; k <= n; ++k)
if(a[k] * A + b[k] * B + c[k] < 0)
Ans = (Ans * 3 + 2) % Mod;
else
Ans = (Ans * 3 + 1) % Mod;
if(Ap[Ans] == 0){
++Num;
Ap[Ans] = 1;
}
}
printf("%d\n", Num);
return 0;
}