1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <math.h>
typedef long long ll;
//https://blog.csdn.net/qq_31964727/article/details/83386878 欢迎讨论
void solve(){
    int t;
    scanf("%d",&t); 
    for(int i=0;i<t;i++){
        ll px,py,ax,ay,bx,by,cx,cy;
        scanf("%lld%lld%lld%lld%lld%lld%lld%lld",&px,&py,&ax,&ay,&bx,&by,&cx,&cy);
        //判断是否不在三角形内 
        if(fabs(px*(by-cy)+bx*(cy-py)+cx*(py-by))+fabs(ax*(py-cy)+px*(cy-ay)+cx*(ay-py))+fabs(ax*(by-py)+bx*(py-ay)+px*(ay-by))==fabs(ax*(by-cy)+bx*(cy-ay)+cx*(ay-by))) printf("YES\n");
        else printf("NO\n");
    }
    
}
int main(){
    solve();
    return 0;
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX