Pagini recente » Cod sursa (job #598720) | Cod sursa (job #109411) | Cod sursa (job #2138205) | Cod sursa (job #999229) | Cod sursa (job #38558)
Cod sursa(job #38558)
#include<fstream.h>
#define input "regiuni.in"
#define output "regiuni.out"
#define Nmax 1005
#define Mmax 1005
#define mod 666013
//using namespace std;
long n,m,a[Mmax],b[Mmax],c[Mmax],dx[Nmax],dy[Nmax],h;
int sec[1000000];
ifstream fin(input);
ofstream fout(output);
long pow(int x)
{
long k=1;
int i;
for (i=1;i<=x;i++)
{
k*=2;
(k>mod)?k%mod:k;
}
return k;
}
void solve()
{
int i,j,k=1,s;
fin>>n>>m;
k=0;
for(i=1;i<=n;i++)
fin>>a[i]>>b[i]>>c[i];
for(i=1;i<=m;i++)
fin>>dx[i]>>dy[i];
for(i=1;i<=m;i++)
{
h=0;
for(j=1;j<=n;j++)
{
s=dx[i]*a[j]+dy[i]*b[j]+c[j];
if(a[j]*b[j]!=0)
{
if(s>0)
h+=pow(j-1);
}
else
{
if(s<0)
h+=pow(j-1);
}
}
sec[h]++;
if(sec[h]==1)
k++;
}
fout<<k<<"\n";
}
int main()
{
solve();
return 0;
}