c++判断一点是否在三角形内，不包括边界

#include <bits/stdc++.h>
using namespace std;
typedef struct node
{
    int x, y;
} point;
point xl(point a, point b)//向量计算
{
    point c;
    c.x = b.x - a.x;
    c.y = b.y - a.y;
    return c;
}
int cal(point a, point b)//叉积的绝对值，这里除2即为三角形面积
{
    return abs(a.x * b.y - a.y * b.x);
}
int main()
{
    point a, b, c, p;//四个点
    while (~scanf("%d%d%d%d%d%d%d%d", &a.x, &a.y, &b.x, &b.y, &c.x, &c.y, &p.x, &p.y))
    {
        int flag = 1;
        if (a.x == 0 && a.y == 0 && b.x == 0 && b.y == 0 && c.x == 0 && c.y == 0 && p.x == 0 && p.y == 0)
            break;
        point pa = xl(p, a), pb = xl(p, b), pc = xl(p, c);
        point ab = xl(a, b), ac = xl(a, c), bc = xl(b, c);
        int s = cal(ab, ac);
        int s1 = cal(pa, ab), s2 = cal(pb, bc), s3 = cal(pc, ac);
        if (s1 == 0 || s2 == 0 || s3 == 0)//点不在三角形边界的判断
            flag = 0;
        if (s == s1 + s2 + s3 && flag == 1)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}