nyist_68_三点顺序

#include <cstdio>
#include <iostream>

using namespace std;

struct point {
    int x, y;
}A, B, C;

int crossProd(point A, point B, point C) {//叉乘 
    return (B.x - A.x) * (C.y - A.y) - (B.y - A.y) * (C.x - A.x);
}

int main() {
    while (1) {
        scanf ("%d%d%d%d%d%d", &A.x, &A.y, &B.x, &B.y, &C.x, &C.y);
        if (A.x + A.y + B.x + B.y + C.x + C.y == 0) break;
        if (crossProd(A, B, C) > 0) printf ("0\n");//点顺时针给出 
        else printf ("1\n");//点逆时针给出 
    }
    return 0;
}