CF#268 (Div. 2) A.

A. I Wanna Be the Guy

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

题目链接：http://codeforces.com/contest/469/problem/A

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).

Sample test(s)

input

43 1 2 32 2 4

output

I become the guy.

input

43 1 2 32 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.

解题思路：

  有n个等级，问两个人合作能否全部通过·······

完整代码：

#include <functional>#include <algorithm>#include <iostream>#include <fstream>#include <sstream>#include <iomanip>#include <numeric>#include <cstring>#include <climits>#include <cassert>#include <complex>#include <cstdio>#include <string>#include <vector>#include <bitset>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <list>#include <set>#include <map>using namespace std;#pragma comment(linker, "/STACK:102400000,102400000")typedef long long LL;typedef double DB;typedef unsigned uint;typedef unsigned long long uLL;/** Constant List .. **/ //{const int MOD = int(1e9)+7;const int INF = 0x3f3f3f3f;const LL INFF = 0x3f3f3f3f3f3f3f3fLL;const DB EPS = 1e-9;const DB OO = 1e20;const DB PI = acos(-1.0); //M_PI;int vis[10000001];int k;int main(){    #ifdef DoubleQ    freopen("in.txt","r",stdin);    #endif    int n;    while(~scanf("%d",&n))    {        int q;        memset(vis , 0 ,sizeof(vis));        scanf("%d",&q);        for(int i = 0 ; i < q ; i ++)        {            scanf("%d",&k);            vis[k] ++;        }        int p;        scanf("%d",&p);        if(p == 0 && q == 0)        {            printf("Oh, my keyboard!\n");            continue;        }        for(int i = 0; i < p ; i ++)        {            scanf("%d",&k);            vis[k] ++;        }        int flag = 0;        for(int i = 1 ; i <= n ; i ++)            if(vis[i] == 0)        {            flag = 1;            break;        }        if(flag == 1)            printf("Oh, my keyboard!\n");        else            printf("I become the guy.\n");    }}