-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathIQTest.cpp
More file actions
67 lines (61 loc) · 1.42 KB
/
IQTest.cpp
File metadata and controls
67 lines (61 loc) · 1.42 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
62
63
64
65
66
67
#include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;
#define int long long
#define endl '\n'
// By: Tamim
void solve()
{
char a[4][4];
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 4; j++)
{
cin >> a[i][j];
}
}
bool f = false;
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
if (a[i][j] == a[i][j + 1] && a[i][j + 1] == a[i + 1][j]) // 11
{ // 10
f = true;
}
if (a[i][j] == a[i][j + 1] && a[i][j + 1] == a[i + 1][j+1]) //11
{ //01
f = true;
}
if (a[i][j] == a[i+1][j + 1] && a[i+1][j + 1] == a[i + 1][j])//10
{ //11
f = true;
}
if (a[i+1][j+1] == a[i][j + 1] && a[i][j + 1] == a[i + 1][j])
{
f = true;
}
}
}
if(f){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
return 0;
}