Pagini recente » Cod sursa (job #1762326) | Cod sursa (job #593379) | Cod sursa (job #2856049) | Cod sursa (job #2006941) | Cod sursa (job #50084)
Cod sursa(job #50084)
#include <cstdio>
#define INF "regiuni.in"
#define OUF "regiuni.out"
#define NMAX 1000
using namespace std;
// int a[NMAX],b[NMAX],c[NMAX],xx[NMAX],yy[NMAX],bit[NMAX][32]={0};
int main()
{
FILE *in,*out;
in=fopen(INF,"r");
out=fopen(OUF,"w");
register int i,j,k,n,m,ok,dim;
register int mask[32];
register int a[NMAX],b[NMAX],c[NMAX],xx[NMAX],yy[NMAX],bit[NMAX][32]={0};
register char use[NMAX]={0};
fscanf(in,"%d %d",&n,&m);
for(i=0;i<32;i++) mask[i]=(1<<i);
// for(i=1;i<=n;i++) printf("%d",mask[i]);
for(i=0;i<n;i++)
fscanf(in,"%d %d %d",a+i,b+i,c+i);
for(i=0;i<m;i++)
fscanf(in,"%d %d",xx+i,yy+i);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
if(xx[i]*a[j]+yy[i]*b[j]+c[j]>0) bit[i][j/32]|=mask[j%32];
}
dim=0;
for(i=0;i<m;i++)
{
if(!use[i])
{
use[i]=1;dim++;
for(j=i+1;j<m;j++)
{
ok=1;
for(k=0;k<32&&ok;k++)
if(bit[i][k]^bit[j][k]) ok=0;
if(ok) use[j]=1;
}
}
}
fprintf(out,"%d\n",dim);
fclose(in);fclose(out);
return 0;
}