nyoj218 Dinner
来源:互联网 发布:男装破洞牛仔裤淘宝网 编辑:程序博客网 时间:2024/05/08 04:20
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
代码:
#include<stdio.h>#include<string.h>int main(){int i,n;char str[100][100];while(scanf("%d",&n)!=EOF){for(i=0;i<n;i++)scanf("%s",str[i]);for(i=0;i<n;i++){if(strcmp(str[i],"fork")==0)printf("fork ");if(strcmp(str[i],"chopsticks")==0)printf("chopsticks ");if(strcmp(str[i],"bowl")==0)printf("bowl ");if(strcmp(str[i],"knife")==0)printf("knife ");}printf("\n");}return 0;}
//何来贪心???!!
0 0
- NYOJ218 Dinner
- nyoj218 Dinner
- nyoj218 Dinner
- nyoj218 Dinner
- nyoj218
- Dinner
- Dinner
- Dinner
- Dinner
- Dinner
- Dinner
- Dinner
- dinner
- Dinner
- Dinner
- Dinner
- Dinner
- Dinner
- [LeetCode] Word Search
- 1005 game-博弈
- POJ1000
- 顺序队列
- js中prototype方法
- nyoj218 Dinner
- UNIX 高手的 10 个习惯
- 网络流量监控技术与方法
- jbpm 中一个 开始就会遇到的错误
- iOS页面跳转及数据传递
- java分页 pager-taglib
- 1-4 输出菱形
- 指针和引用的区别
- 1001 Post Robot--字符串的比较问题