Pagini recente » Cod sursa (job #1339346) | Cod sursa (job #978258) | Cod sursa (job #2831934) | Cod sursa (job #479699) | Cod sursa (job #2476457)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("regiuni.in");
ofstream g ("regiuni.out");
int d ,p, a,b,c,x,y;
int v[8][1001];
int num[1001][1001];
int main()
{
f>>d>>p;
for(int i=1;i<=d;++i)
{
f>>a>>b>>c;
v[1][i]=a;
v[2][i]=b;
v[3][i]=c;
//cout<<v[1][i]<<v[2][i]<<v[3][i]<<"\n";
}
int k=1;
for(int i=1;i<=p;++i)
{
// cout<<"\n pct "<<i<<": ";
f>>x>>y;
int tmp[1001];
for(int j=1;j<=d;++j)
{
if(x*v[1][j]+y*v[2][j]+v[3][j] >0)
tmp[j]=1;
else tmp[j]=0;
// cout<<tmp[j]<<" ";
}
int sw=1;
for(int y=1;y<=k;++y)
{
sw=0;
for(int j=1;j<=d;++j)
{
// cout<<"\n tmp: "<<tmp[j]<<" at "<< y<< ": "<<num[y][j];
if(tmp[j] != num[y][j])
{
sw=1;
break;
}
}
if(sw==0)
break;
}
// cout<<"=>"<<sw<<"\n\n\n";
if(sw==1)
{
for(int t=1;t<=d;++t)
{
num[k][t]=tmp[t];
}
k++;
}
}
g<<k-1;
return 0;
}