一、 I Wanna Be the Guy

本题链接： I Wanna Be the Guy

题目：
A. I Wanna Be the Guy
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

本博客给出本题截图：

题意：如果两个人会的所有level包括了题目中要求的所有level，那就输出I become the guy.，否则输出Oh, my keyboard!

AC代码

#include <iostream>
#include <set>using namespace std;set <int> s;int main()
{int n;cin >> n;int p;cin >> p;for (int i = 0; i < p; i ++ ){int a;cin >> a;s.insert(a);}int q;cin >> q;for (int i = 0; i < q; i ++ ){int a;cin >> a;s.insert(a);}if (s.size() == n)puts("I become the guy.");else puts("Oh, my keyboard!");return 0;
}

总结

水题，不解释

I Wanna Be the Guy相关推荐

关闭antimal_i wanna be the brown animal键位怎么操作玩法攻略
i wanna be the brown animal键位怎么操作玩法攻略,i wanna be the brown animal硬盘版是i wanna系列的又一款经典之作了,里面的游戏boss根据神 ...
HDU 5308 I Wanna Become A 24-Point Master
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5308 题面: I Wanna Become A 24-Point Master Time Limit ...
基于cocos-2dx的游戏制作——I wanna save the princess
在进行了两周的cocos学习之后,可以开始进行游戏的创作了. I wanna主要复杂的地方在于地图的设计以及逻辑实现.下面依次进行介绍.(使用c++) 一．瓦片地图--tile map 1. 地图整 ...
Wanna Cry病毒之后，那些值得我们注意的事实和真相
英国多家医院的电脑数据被锁死,病人排起长队,医院被迫恢复了手写单据的模式: 美国多家高校的内网被锁死,论文和学术资料无法恢复,答辩在即的学生只能重新起草论文: 中国某铁路局的门禁系统被锁死,车辆无法进 ...
gonna,gotta,wanna的区别（参考牛津）
1.原型 gonna的原型是going to gotta的原型是(have) got to wanna的原型是want to 2.意义 gonna表示"将要"的意思 gotta表示 ...
【American English】美语口语中常见的 Gonna、wanna、gotta 含义及用法
1 [American English]美式发音,英语发音,美国音音标列表及发音 2 [American English]美语的连读规则 3 [American English]美语口语中常见的 Go ...
深度学习AI美颜系列----AI美甲算法揭秘(WANNA NAILS)
本文将给大家分享WANNA NAILS App中漂亮的美甲效果是如何实现的,对其背后的图像算法技术做一个详解. WANNA NAILS是一款专门做美甲效果的app,效果举例如下: WANNA NAIL ...
I wanna go home
题目网址:I wanna go home 题目大意:给出n个城市 ,给出m对城市之间的距离,再给出每一个城市的所属的阵营,要求求出从城市1到城市2的最小的路径长度,城市1总是属于阵营1的,城市2是属于 ...
A. I Wanna Be the Guy
题目描述:http://codeforces.com/problemset/problem/469/A 469A. I Wanna Be the Guy time limit per test1 se ...

I Wanna Be the Guy

文章目录

一、 I Wanna Be the Guy

总结

I Wanna Be the Guy相关推荐

最新文章

热门文章