1052: Dinner

  1. 云栖社区>
  2. 博客列表>
  3. 正文

1052: Dinner

hybcoder 2012-10-09 07:13:00 浏览403 评论0

摘要: 1052: Dinner Time Limit: 1 Sec  Memory Limit: 32 MBSubmit: 50  Solved: 9 [Submit][Status][Web Board] Description Little A is one member of ACM team.

1052: Dinner

Time Limit: 1 Sec  Memory Limit: 32 MB
Submit: 50  Solved: 9
[Submit][Status][Web Board]

Description

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.

Input

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.

Output

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

Sample Input

3 basketball fork chopsticks2 bowl letter

Sample Output

fork chopsticksbowl

HINT


The tableware only contains: bowl, knife, fork and chopsticks.

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
#include <iostream>
#include <string>
 
using namespace std;
 
bool IsEqual(string tmp)
{
    return (tmp == "bowl" || tmp == "fork" || tmp == "chopsticks" || tmp == "knife");
}
int main()
{
    int num, k, count;
    string tmp;
 
    while (cin >> num)
    {
        k = 0;
        count = 0;
        while (count < num)
        {
            cin >> tmp;
            if (IsEqual(tmp))
            {
                if (k != 0)
                {
                    cout << " ";
                }
                cout << tmp;
                k ++;
            }
            count ++;
        }
       // if (k != 0)//如果没有匹配到任何一个,就不输出回车
        cout << endl;
    }
    return 0;
}
 
/**************************************************************
    Problem: 1052
    User: 1006440533
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1272 kb
****************************************************************/

【云栖快讯】你想见的Java技术专家都在这了,向大佬提问,有问题必答  详情请点击

网友评论

hybcoder
文章522篇 | 关注17
关注
为您提供简单高效、处理能力可弹性伸缩的计算服务,帮助您快速构建更稳定、安全的应用,提升运维效... 查看详情
RDS是一种稳定可靠、可弹性伸缩的在线数据库服务。支持MySQL、SQL Server、Po... 查看详情
阿里云总监课正式启航

阿里云总监课正式启航