题解 | 田忌赛马

#include <stdio.h>
int main() {
    int tian[3], king[3];
    int i, j, k;
    scanf("%d %d %d", &king[0], &king[1], &king[2]);
    scanf("%d %d %d", &tian[0], &tian[1], &tian[2]);
   for(i=0;i<3;i++){
    for(j=0;j<3;j++){
        if(i==j) continue;
        for(k=0;k<3;k++){
            if(k==i||k==j) continue;
            int wincount=0;
            if(tian[i]>king[0]) wincount++;
            if(tian[j]>king[1]) wincount++;
            if(tian[k]>king[2]) wincount++;
            if(wincount>=2){
                printf("Yes");
                return 0;
            }
        }
    }
   }
   printf("No");
    return 0;
}