Pagini recente » Cod sursa (job #712159) | Cod sursa (job #1933045) | Cod sursa (job #275838) | Cod sursa (job #2961431) | Cod sursa (job #1106268)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("regiuni.in");
ofstream g("regiuni.out");
int MOD=1e9+7;
int i,j,k,N,M,cr,X,Y;
int main()
{
long long int h[1001];
int m[1001][3];
f>>N>>M;
for (i=1;i<=N;++i)
{
f>>m[i][1]>>m[i][2]>>m[i][3];
}
for (i=1;i<=M;++i)
{
f>>X>>Y;
for (j=1;j<=N;++j)
{
if (m[j][1]*X+m[j][2]*Y+m[j][3]>0)
{
h[i]+=m[j][1]*900060001+m[j][2]*30001+m[j][3];
h[i]%=MOD;
}
}
}
g<<unique(h+1,h+M+1)-h-1;
return 0;
}