Pagini recente » Cod sursa (job #1639315) | Cod sursa (job #1972460) | Cod sursa (job #2222322) | Cod sursa (job #3241804) | Cod sursa (job #3232661)
#include <bits/stdc++.h>
using namespace std;
int main() {
freopen("regiuni.in", "r", stdin);
freopen("regiuni.out", "w", stdout);
int n, m;
cin >> n >> m;
vector<vector<int>> d(n, vector<int>(3));
for(int i = 0;i < n;++i)
cin >> d[i][0] >> d[i][1] >> d[i][2];
vector<vector<int>> p(m, vector<int>(2));
for(int i = 0;i < m;++i)
cin >> p[i][0] >> p[i][1];
map<vector<int>, int> mp;
for(int i = 0;i < m;++i)
{
vector<int> tmp;
for(int j = 0;j < n;++j)
{
int v = d[j][0] * p[i][0] + d[j][1] * p[i][1] + d[j][2];
if(v > 0)
tmp.push_back(1);
else
tmp.push_back(0);
}
++mp[tmp];
}
cout << mp.size() << "\n";
}