-
Notifications
You must be signed in to change notification settings - Fork 0
/
1861B_Two Binary Strings.cpp
156 lines (139 loc) · 2.78 KB
/
1861B_Two Binary Strings.cpp
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
// Haloom
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
#define endl '\n'
#define PB push_back
#define F first
#define S second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(x) (int)x.size()
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
#define MOD 1000000007
#define mem(a, b) memset(a, b, sizeof(a))
#define sqr(a) ((a) * (a))
#define optimize() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fraction() \
cout.unsetf(ios::floatfield); \
cout.precision(10); \
cout.setf(ios::fixed, ios::floatfield);
#define file() \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define dbg(args...) \
do \
{ \
cerr << #args << " : "; \
debug(args); \
} while (0)
void debug()
{
cerr << endl;
}
template <typename T, typename... hello>
void debug(T arg, const hello &...rest)
{
cerr << arg << ' ';
debug(rest...);
}
ll gcd(ll a, ll b)
{
return __gcd(a, b);
}
ll lcm(ll a, ll b)
{
return a * (b / gcd(a, b));
}
int diff(int a, int b)
{
return b - a;
}
bool check_palindrome(string s)
{
string a = s;
reverse(a.begin(), a.end());
if (s == a)
{
return true;
}
else
{
return false;
}
}
bool check_square(int n)
{
int s = sqrt(n);
return s * s == n;
}
bool check_cube(int n)
{
int s = round(cbrt(n));
return s * s * s == n;
}
bool check_prime(int n)
{
if (n == 1)
{
return false;
}
for (int i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
return false;
}
}
return true;
}
int main()
{
optimize();
int t;
cin >> t;
while (t--)
{
string a, b;
cin >> a >> b;
bool flag = false;
int c = 0;
for (int i = 0; i < a.size() - 1; i++)
{
if (a[i] == '0' && b[i + 1] == '1' && a[i] == b[i] && a[i + 1] == b[i + 1])
{
flag = true;
}
// if (c >= 2)
// {
// break;
// }
}
//cout<<c<<endl;
if (flag)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
return 0;
}