/*
*
*
*/

#include <iostream>
#include "fraction.h"
#include "point.h"

using namespace std;

Point FindOutsidePoint(Point * Q, int size, Point p1);
bool Intersect(Point p1, Point p2, Point q1, Point q2);
bool isOnBorder(Point * Q, int size, Point p1);

int main() {
/**
* The program should start by reading the number of vertices in polygon Q;
* the number of vertices will not exceed 100. Next, read the vertices
* and store them in an array. Finally, read the position of point p1.
*/
int size;
Point Q[100];
Point p1;

// read the number of vertices in polygon Q
cin >> size;

// read the vertices and store them in an array
for (int i = 0; i < size; i++) {
   cin >> Q[i];
}

// Finally, read the position of point p1
cin >> p1;

/**
* Find point p2, then loop through each edge of the polygon and count
* the number of edges that intersect line segment p1p2.
* Output an appropriate message about whether or not p1 is inside or
* outside of the polygon.
*
*/

Point p2 = FindOutsidePoint(Q, size, p1);
int intersect = 0;
// loop through each edge of the polygon
for (int i = 0; i < size; i++) {
   Point q1 = Q[i];
   Point q2 = Q[(i + 1) % size];
   if (Intersect(p1, p2, q1, q2)) {
         intersect++;
   }
}

/**
* The final issue is checking to see if p1 is on an edge of the polygon.
* For the basic project, we will assume that this wonâ€™t happen.
* For 10% extra credit for the project, incorporate a check for this
* situation. It will involve a slight modification of the next algorithm.
*/
/**
* it is easy to see that p1 is inside the polygon Q if
* and only if the line segment crosses an odd number of polygon edges
*/
cout << "Basic project:\n";
if (intersect

Question 3 a) Assume you are in an interview for a job. The job...