NYOJ-Dinner

Dinner

时间限制：100 ms  |  内存限制：65535 KB

难度：1

描述

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.

 1 #include <stdio.h>
 2 #include <string.h>
 3 int main(void){
 4     int N,flag; char s[100];
 5     char dis[][11]={"bowl", "knife", "fork", "chopsticks"};
 6     while(scanf("%d",&N) != EOF){
 7         flag = 0;///控制空格的输出
 8         while(N--){
 9             scanf("%s",s);
10             for(int i = 0; i < 4; i++){
11                 if(strcmp(s,dis[i]) == 0){
12                     if(flag != 0)
13                         printf(" ");
14                     printf("%s",s);
15                     flag = 1;
16                 }
17             }
18         }
19         printf("\n");
20     }
21     return 0;
22 }