Dinner nyoj 水题
来源:互联网 发布:家中网络接口 编辑:程序博客网 时间:2024/06/07 22:06
Dinner
时间限制:100 ms | 内存限制:65535 KB
描述
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.
来源
时间限制:100 ms | 内存限制:65535 KB
描述
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.
来源
辽宁省10年省赛
#include<stdio.h>#include<string.h>char s[20];char ans[110];int main(){ int n; while(~scanf("%d",&n)) { char stand[4][20]={"bowl","fork","knife","chopsticks"}; int p=0; for(int i=0;i<n;i++) { scanf("%s",s); for(int j=0;j<4;j++) { if(strcmp(s,stand[j])==0) { int len=strlen(s); for(int k=0;k<len;k++) ans[p++]=s[k]; ans[p++]=' '; stand[j][0]='\0'; } } } p--; for(int i=0;i<p;i++) printf("%c",ans[i]); printf("\n"); }}
- Dinner nyoj 水题
- nyoj 218 Dinner(水题)
- NYOJ--Dinner
- NYOJ Dinner
- nyoj-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
- 堆排序
- ASIHTTPRequest
- OpenGL---GLUT教程(五) GLUT键盘控制
- Linux下远程升级脚本
- Android SDK下载和更新失败的解决方法
- Dinner nyoj 水题
- 关于在VC工程中接入jsonCpp的lib报LINK 2005解决方法
- Android中的activity
- Linux下搭建Android开发环境
- soj 9161. VOYAGER
- webgl入门
- axis1 配置handler,报错找不到handler
- OCP-1Z0-053-V12.02-84题
- IO基础学习