Competitive Programing Problem Solutions/Geometry/test (2).cpp
bool PointOnBoundaryOfPolygon(const vector<PT>p, PT q){
    int s=p.size();
    for(int i=0, j=s-1; i<s; j=i++){
        if(PointOnSegment(q, p[j], p[i])) return true;
    }
    return false;
}
/// Determines whether a point 'q' is on the boundary of the polygon 'p' or not

Determines whether a point 'q' is on the boundary of the polygon 'p' or not
Determines whether a point ' q ' is on the boundary of the polygon ' p ' or not
bool PointOnBoundaryOfPolygon(const vector<PT>p, PT q){
    int s=p.size();
    for(int i=0, j=s-1; i<s; j=i++){
        if(PointOnSegment(q, p[j], p[i])) return true;
    }
    return false;
}
bool PointOnBoundaryOfPolygon ( const vector < PT > p , PT q ) { int s = p . size ( ) ; for ( int i = 0 , j = s - 1 ; i < s ; j = i ++ ) { if ( PointOnSegment ( q , p [ j ] , p [ i ] ) ) return true ; } return false ; }
Determines whether a point 'q' is on the boundary of the polygon 'p' or not
Determines whether a point ' q ' is on the boundary of the polygon ' p ' or not