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.

一道非常簡單的題，雖然是水題但是還是要寫部落格的啦。不多說，直接上程式碼啦。

 
#include <iostream>
#include<stdio.h>
#include <string.h>
using namespace std;
int main(int argc,char* argv[])
{
    int n,i,l,j;
    char stick[100][20],u[4][20]={"bowl","knife","fork","chopsticks"},slect[100][20];
    while(~scanf("%d",&n))
    { l=0;
      for(i=0;i<n;i++)
        scanf("%s",stick[i]);
      for(i=0;i<n;i++)
       for(j=0;j<4;j++)
       if(strcmp(stick[i],u[j])==0)
       {
           strcpy(slect[l++],stick[i]);
           break;
       }
       for(i=0;i<l;i++)
       {
           if(i!=l-1)
           printf("%s ",slect[i]);
           else
           printf("%s\n",slect[i]);
       }
    }
    return 0;
}