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.
題目大意：
輸入的單詞如果是bowl,knife,fork或者chopsticks裏的其中一個的話，輸出。
代碼：
#include<cstdio> #include<cstring> int main() { int n; while(~scanf("%d",&n)) { char s[20]; while(n--) { scanf("%s",s); if(!(strcmp(s,"bowl")&&strcmp(s,"knife")&&strcmp(s,"fork")&&strcmp(s,"chopsticks"))) printf("%s ",s); } printf("\n"); } return 0; }