-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathwannaBeGuy.cpp
60 lines (52 loc) · 1.1 KB
/
wannaBeGuy.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
#include<iostream>
using namespace std;
int main()
{
int levels;
cin>>levels;
int n1; // number of levels X can pass
int n2;
cin>>n1;
int x[n1];
// int y[n2];
// cin>>n1;
for(int i=0;i<n1;i++){
cin>>x[i];
}
cin>>n2;
int y[n2];
for(int i=0;i<n2;i++){
cin>>y[i];
}
int ansarr[n1+n2];
for(int i=0;i<n1;i++){
ansarr[i]=x[i];
}
for(int j=0;j<n2;j++){
ansarr[j+n1]=y[j];
}
// check :
// for(int i=0;i<n1+n2;i++){
// cout<<ansarr[i]<<" ";
// }
// if ansarr has all elements from 1 to n => cout<<"I become the guy";
// if any of the elements miss form ansarr => cout<<"Oh, my keyboard!";
// int flag = 0;
// cout<<endl;
int flag;
for(int j=1;j<=levels;j++){
flag = 0;
for(int i=0;i<n1+n2;i++){
if(j==ansarr[i]){
flag =1;
}
}
if(flag == 0){
cout<<"Oh, my keyboard!";
break;
return 0;
}
}
if(flag ==1 ) cout<<"I become the guy.";
return 0;
}