https://ac.nowcoder.com/acm/contest/322/K

题解：

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a[10][10];
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&t);
    int T=0;
    while(t--){
            n=0;
            m=0;
        for(int i=1;i<=3;i++){
            for(int j=1;j<=4;j++){
                scanf("%d",&a[i][j]);
                if(i==1&&a[i][j])
                    n=a[i][j];
                if(i==3&&a[i][j])
                    m=a[i][j];
            }
        }
        if(n&&m&&n==m&&a[2][1]==a[2][3]&&a[2][2]==a[2][4])
            cout << "Yes!" << endl;
        else
            cout << "No!" << endl;
        T++;
        if(T%50==0){
            cout  << endl;
        }
    }

    //cout << "Hello world!" << endl;
    return 0;
}