题解3-P

There is a game called “I Wanna Be the Guy”, consisting of n levels. Little X and his friend Little Y are addicted to the game. Each of them wants to pass the whole game.

Little X can pass only p levels of the game. And Little Y can pass only q levels of the game. You are given the indices of levels Little X can pass and the indices of levels Little Y can pass. Will Little X and Little Y pass the whole game, if they cooperate each other?

Input
The first line contains a single integer n (1 ≤  n ≤ 100).

The next line contains an integer p (0 ≤ p ≤ n) at first, then follows p distinct integers a1, a2, …, ap (1 ≤ ai ≤ n). These integers denote the indices of levels Little X can pass. The next line contains the levels Little Y can pass in the same format. It’s assumed that levels are numbered from 1 to n.

Output
If they can pass all the levels, print “I become the guy.”. If it’s impossible, print “Oh, my keyboard!” (without the quotes).

Examples
Input
4
3 1 2 3
2 2 4
Output
I become the guy.
Input
4
3 1 2 3
2 2 3
Output
Oh, my keyboard!
Note
In the first sample, Little X can pass levels [1 2 3], and Little Y can pass level [2 4], so they can pass all the levels both.

In the second sample, no one can pass level 4.

题解
找到两行里面最大的数，跟第一个数比较，如果大于等于，则输出“I become the guy.”，要不然输出“Oh, my keyboard!”

代码

#include <stdio.h>
#include <string.h>
#define N 101
using namespace std;
int vis[N];
int main(){
	int n, a, b, flag;
	while (scanf("%d", &n) != EOF){
		memset(vis, 0, sizeof(vis));
		scanf("%d", &a);
		for (int i = 0; i < a; i++){
			int tmp;
			scanf("%d", &tmp);
			vis[tmp]++;
		}
		scanf("%d", &b);
		for (int i = 0; i < b; i++){
			int tmp;
			scanf("%d", &tmp);
			vis[tmp]++;
		}
		flag = 1;
		for (int i = 1; i <= n; i++)
			if (!vis[i]){
				flag = 0;
				break;
			}
		if (flag)
			puts("I become the guy.");
		else
			puts("Oh, my keyboard!");
	}
    return 0;
}