-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA.cpp
55 lines (54 loc) · 1.28 KB
/
A.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
/*
Templete by norman/KNN-07
*/
#include <bits/stdc++.h>
using namespace std;
#define el endl
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define pf push_front
#define fi first
#define nd second
#define forinc(i, a, b) for (int i = a; i <= b; i++)
#define fordec(i, a, b) for (int i = a; i >= b; i--)
#define mms(a, v) memset(a, v, sizeof(a))
#define lwb(a, v) lower_bound(a.begin(), a.end(), v)
#define upb(a, v) upper_bound(a.begin(), a.end(), v)
typedef long long ll;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<bool> vb;
typedef unordered_set<char> chrset;
int main()
{
// stdin
// freopen("<file name insert>.inp", "r", stdin);
// freopen("<file name insert>.out", "w", stdout);
// Code here
int n;
cin >> n;
set<int> inp;
for (int i = 0; i < 2; i++)
{
int q;
cin >> q;
for (int p = 0; p < q; p++)
{
int tmp;
cin >> tmp;
inp.insert(tmp);
}
}
if (inp.size() == n)
{
cout << "I become the guy.";
}
else
cout << "Oh, my keyboard!";
}