Pagini recente » Cod sursa (job #2962025) | Cod sursa (job #547089) | Cod sursa (job #2913314) | Cod sursa (job #151332) | Cod sursa (job #2202608)
#include <iostream>
#include <fstream>
#include <iomanip>
#define NMAX 60001
using namespace std;
ifstream fin("poligon.in");
ofstream fout("poligon.out");
struct Point
{
int x,y;
} v[NMAX],a[NMAX];
long double Aria,auxAria,copie;
int N,M,Nrpoints;
void Read()
{
fin>>N>>M;
for(int i =1 ; i <= N; i++)
{
fin>>v[i].x>>v[i].y;
}
v[N+1]=v[1];
for(int i =1 ; i <= M; i++)
{
fin>>a[i].x>>a[i].y;
}
}
inline long double determinant1(const Point &firstPoint, const Point &secondPoint)
{
return firstPoint.x * secondPoint.y - secondPoint.x*firstPoint.y;
}
void AreaPoligon()
{
for(int i = 1; i <= N; i ++)
{
Aria+=determinant1(v[i],v[i+1]);
}
}
inline long double determinant2(const Point &auxPoint,const Point &firstPoint, const Point &seconPoint)
{
int a,b,c,d,e,f;
a=auxPoint.x;
b=auxPoint.y;
c=firstPoint.x;
d=firstPoint.y;
e=seconPoint.x;
f=seconPoint.y;
return a*d + e*b + c*f - e*d - a*f-c*b ;
}
int AreaPoligonAux(Point auxPoint)
{
for(int i =1 ; i <= N; i++)
{
auxAria+=determinant2(auxPoint,v[i],v[i+1]);
}
return auxAria/2;
}
void Apart()
{
for(int i =1 ; i <= M; i++)
{
auxAria=0;
copie=AreaPoligonAux(a[i]);
if(copie==Aria/2)
Nrpoints++;
}
}
int main()
{
Read();
AreaPoligon();
Apart();
fout<<Nrpoints;
return 0;
}