Repository navigation
Expand file tree
/
Copy pathA_YES_or_YES.cpp
More file actions
90 lines (82 loc) · 1.89 KB
/
Copy pathA_YES_or_YES.cpp
File metadata and controls
90 lines (82 loc) · 1.89 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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <bits/stdc++.h>
using namespace std;
// Macros
#define ll long long
#define vb vector<bool>
#define vl vector<long long>
#define vi vector<int>
#define vvl vector<vector<long long>>
#define vpl vector<pair<long long, long long>>
#define ml map<long long, long long>
#define mpl map<pair<long long, long>, pair<long long, long long>>
#define pl pair<long long, long long>
#define sort(x) sort(x.begin(), x.end())
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define seea(a, x, y) \
for (int i = x; i < y; i++) \
{ \
cin >> a[i]; \
}
#define seev(v, n) \
for (int i = 0; i < n; i++) \
{ \
int x; \
cin >> x; \
v.push_back(x); \
}
#define sees(s, n) \
for (int i = 0; i < n; i++) \
{ \
int x; \
cin >> x; \
s.insert(x); \
}
#define rep(i, a, b) for (int i = a; i < b; i++)
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
// Constants
const long long MOD = 1e9 + 7;
const long N = 1e5 + 7;
const long long llmax = LONG_LONG_MAX;
void solve()
{
string s;
cin >> s;
if (s[0] == 'y' || s[0] == 'Y')
{
if (s[1] == 'e' || s[1] == 'E')
{
if (s[2] == 's' || s[2] == 'S')
{
cout << "YES" << endl;
return;
}
else
{
cout << "NO" << endl;
return;
}
}
else
{
cout << "NO" << endl;
return;
}
}else{
cout << "NO" << endl;
}
}
int main()
{
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}