#include <stdio.h> #include <map> #include <algorithm> using namespace std; int main() { int n, m, x, y, z; int A[512], B[512], C[512], D[512]; while (scanf("%d %d", &n, &m) == 2) { for (int i = 0; i < n; i++) scanf("%d %d %d %d", A+i, B+i, C+i, D+i); map<unsigned int, int> R; for (int i = 0; i < m; i++) { scanf("%d %d %d", &x, &y, &z); unsigned int a = 63689, b = 378551; unsigned int value = 0; for (int j = 0; j < n; j++) { if (A[j] * x + B[j] * y + C[j] * z > D[j]) value = value * a + 1; else value = value * a + 0; a *= b; } R[value]++; } int ret = 0; for (map<unsigned int, int>::iterator it = R.begin(); it != R.end(); it++) ret = max(ret, it->second); printf("%dn", ret); } return 0; } */
|
近期评论