Pagini recente » Borderou de evaluare (job #2388894) | Cod sursa (job #2472200) | Cod sursa (job #1931626) | Cod sursa (job #2986973) | Cod sursa (job #2390093)
#include<bits/stdc++.h>
using namespace std;
ifstream in("regiuni.in");
ofstream out("regiuni.out");
const int NMAX = 1e3 + 1e2;
struct Data{
double a;
double b;
double c;
};
int n, m;
Data v[NMAX];
unordered_set < bitset < NMAX > > vals;
int main()
{
in >> n >> m;
for(int i = 0; i < n; i++) {
in >> v[i].a >> v[i].b >> v[i].c;
}
for(int i = 0; i < m; i++) {
double x, y;
in >> x >> y;
bitset < NMAX > tmp;
for(int j = 0; j < n; j++) {
if((v[j].a * x + v[j].b * y + v[j].c) > 0)
tmp[j] = 1;
}
vals.insert(tmp);
}
out << vals.size() << '\n';
in.close();
out.close();
return 0;
}