Pagini recente » Cod sursa (job #663656) | Cod sursa (job #985386) | Cod sursa (job #402256) | Cod sursa (job #2674833) | Cod sursa (job #1471790)
#include<fstream>
#include<map>
#define ll long long
#define mk make_pair
using namespace std;
ifstream fi("regiuni.in"); ofstream fo("regiuni.out");
int a[1001],b[1001],c[1001],x[1001],y[1001];
map <pair<int,int>,bool> s;
int main(void)
{ int n,m,i,nr=0;
fi>>n>>m;
for(i=1;i<=n;++i) fi>>a[i]>>b[i]>>c[i];
for(i=1;i<=m;++i) fi>>x[i]>>y[i];
for(i=1;i<=m;++i)
{ int r1=0,r2=0;
for(int j=1;j<=n;++j)
{ ll v=1ll*a[j]*x[i]+1ll*b[j]*y[i]+c[j];
v=(v>0);
r1=(r1*10+v)%666013; r2=(r2*10+v)%997;
}
if (!s.count(mk(r1,r2))) {++nr; s[mk(r1,r2)]=1;}
}
fo<<nr<< '\n'; fo.close(); return 0;
}