nyoj 218 Dinner【简单字符串处理】
来源:互联网 发布:中国基尼系数算法 编辑:程序博客网 时间:2024/05/29 14:37
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");}}
0 0
- nyoj 218 Dinner【简单字符串处理】
- NYOJ - 218 - Dinner(简单问题)
- NYOJ 218 Dinner (字符串&贪心)
- NYOJ-218 Dinner(字符串判断)
- NYOJ 218题 Dinner
- nyoj-218-Dinner
- NYOJ 218 Dinner
- nyoj 218 dinner
- nyoj-218-Dinner
- NYOJ 218 Dinner
- NYOJ 218 Dinner
- NYOJ 218 Dinner
- NYOJ 218 Dinner
- nyoj 218 Dinner
- nyoj 218Dinner<水>
- NYOJ 218 Dinner
- NYOJ 218 Dinner
- nyoj-218-Dinner
- Android Activity Task taskAffinity launchMode 之间的关系
- uva 10794 - The Deadly Olympic Returns!!!(几何)
- 门禁系统(ccf真题)
- Java并发:Lock
- Android Stuido中SVN的设置
- nyoj 218 Dinner【简单字符串处理】
- 编码格式设置之tomcat&mysql
- iOS SDK详解之UITabbar(仿新浪微博的Demo)
- java IO流分析
- MVC 入门路由选择二 定义默认值与静态路由
- uva 11836 - Star War(几何)
- 2015湖南省ACM大赛F题阶乘除法
- 简介分布式计算系统的硬件架构
- C++ Primer : 第十三章 : 拷贝控制之拷贝、赋值与销毁