nyoj 218 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 chopsticks2 bowl letter样例输出fork chopsticksbowl提示The tableware only contains: bowl, knife, fork and chopsticks.来源辽宁省10年省赛上传者ACM_李如兵

思路:

直接遍历所有的字符串,,看看有没有题上给的那四个字符串,如果有的话就输出,如果没有的话,就什么也不输出!但是需要注意输出的格式,在第一个字符串前面没有空格,所以要控制好这一点!

代码:

#include <stdio.h>#include <string.h>int main(){int n;char a[15];int flag;while(scanf("%d",&n)!=EOF){flag=0;for(int i=1;i<=n;i++){getchar();scanf("%s",a);if(strcmp(a,"bowl")==0){if(flag)printf(" ");elseflag=1;printf("bowl");}else if(strcmp(a,"knife")==0){if(flag)printf(" ");elseflag=1;printf("knife");}else if(strcmp(a,"fork")==0){if(flag)printf(" ");elseflag=1;printf("fork");}else if(strcmp(a,"chopsticks")==0){if(flag)printf(" ");elseflag=1;printf("chopsticks");}}printf("\n");}}

版权声明:本文为博主原创文章,未经博主允许不得转载。

成功不是将来才有的,而是从决定去做的那一刻起,持续累积而成。

nyoj 218 Dinner【简单字符串处理】

相关文章:

你感兴趣的文章:

标签云: