Pagini recente » Borderou de evaluare (job #700740) | Cod sursa (job #801873)
Cod sursa(job #801873)
#include<fstream>
#include<cstdio>
using namespace std;
int n,m,sol;
int a[1010],b[1010],c[1010];
int hash[2][1010];
int MOD[2]={666013,666019};
int f[2]={7,11};
int main()
{
int i,j,x,y,A,B;
bool gasit;
freopen("regiuni.in","r",stdin);
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d %d %d",a+i,b+i,c+i);
for(i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
A=B=0;
for(j=1;j<=n;j++)
{
if(a[j]*x+b[j]*y+c[j]>0)
{
A=(f[0]*A+2)%MOD[0];
B=(f[0]*B+2)%MOD[0];
}
else
{
A=f[0]*A%MOD[0];
B=f[0]*B%MOD[0];
}
}
hash[0][i]=A;
hash[1][i]=B;
}
for(i=1;i<=m;i++)
{
gasit=false;
for(j=1;j<i && !gasit;j++)
{
if(hash[0][i]==hash[0][j] && hash[1][i]==hash[1][j])
gasit=true;
}
if(!gasit)
sol++;
}
freopen("regiuni.out","w",stdout);
printf("%d\n",sol);
return 0;
}