-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathday5.cpp
More file actions
61 lines (54 loc) · 1.31 KB
/
day5.cpp
File metadata and controls
61 lines (54 loc) · 1.31 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 10e8;
#define loop3(i, a, b) for (i = a; i <= b; i++)
#define nl '\n'
#define loop(n) for (int i = 0; i < n; i++)
#define loop2(n) for (int j = 0; j < n; j++)
#define py cout << "YES" << nl
#define pn cout << "NO" << nl
#define print(ans) cout << ans << nl
#define isEven(n) if (n % 2 == 0)
typedef long long ll;
typedef vector < ll > vll;
typedef vector < int > vi;
typedef vector < char > vch;
template < typename T1, typename T2 >
using vpp = vector < pair < T1, T2 >> ;
template < typename T >
void inputArray(vector < T > & arr, int n)
{
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
}
template < typename T >
void outputArray(vector < T > & arr, int n)
{
for (int i = 0; i < n; i++)
{
cout << arr[i] << nl;
}
}
int t;
vector < vector < int >> arr(3, vector < int > (2));
int main()
{
cin >> t;
while (t--) {
loop(3){
loop2(2){
cin>>arr[i][j];
}
}
if((arr[0][0]!=arr[1][0] && arr[1][0]!=arr[2][0] && arr[2][0]!=arr[0][0])
|| (arr[0][1]!=arr[1][1] && arr[1][1]!=arr[2][1] && arr[2][1]!=arr[0][1])){
py;
}
else{
pn;
}
}
return 0;
}