时间限制：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<stdio.h> #include<string.h> int main() { int n; int i;//循环变量 int t;//控制空格变量 int a[1010]; char s[1010][20]; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) { scanf("%s",s[i]); a[i]=0; if(strcmp(s[i],"fork")==0||strcmp(s[i],"bowl")==0||strcmp(s[i],"knife")==0||strcmp(s[i],"chopsticks")==0) { a[i]=1; } } t=0; for(i=0;i<n;i++) { if(a[i]==1) { if(t>0) { printf(" "); } printf("%s",s[i]); t++; } } printf("\n"); } return 0; }
题目大意：输入N个字符串，判断是否为四种餐具。利用strcmp()函数匹配，比较是否相等。注意输出格式，需要设置一个空格变量。
