Problem 2501 --Dinner

2501: Dinner

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $81$ 正确数量 $27$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签
Little A is one member of ACM team. He had just won the gold in World Final. To celebrate, he decided to invite all to have one meal. As bowl, knife and other tableware is not enough in the kitchen, Little A goes to take backup tableware in warehouse. There are many boxes in warehouse, one box contains only one thing, and each box is marked by the name of things inside it. For example, if "basketball" is written on the box, which means the box contains only basketball. With these marks, Little A wants to find out the tableware easily. So, the problem for you is to help him, find out all the tableware from all boxes in the warehouse.


There are many test cases. Each case contains one line, and one integer N at the first, N indicates that there are N boxes in the warehouse. Then N strings follow, each string is one name written on the box.

For each test of the input, output all the name of tableware.

3 basketball fork chopsticks
2 bowl letter
fork chopsticks
bowl
The tableware only contains: bowl, knife, fork and chopsticks.


推荐代码 查看2501 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$0 $ms] 亿万萌妹的梦汪鹏172 458978 2019-08-18 17:08:32
内存最少[$944 $KB] 却又像风捉摸不住 214837 2018-03-30 12:30:11
第一AC 冯夏雷@电子信息工程152 187116 2017-12-24 19:56:30
第一挑战 张宗波@电子信息工程152 186900 2017-12-24 19:23:10

赛题来源/所属竞赛 N/A

竞赛编号 竞赛名称 竞赛时间 访问比赛
1139 2017-2018-1学期15电信12《Java编程技术》期末考试# 2017-12-24 19:10:00 请登录