nyoj-218-Dinner
来源:互联网 发布:凌米刷机软件 编辑:程序博客网 时间:2024/05/11 05: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.
#include "iostream"#include "string.h"using namespace std;main(int argc, char const *argv[]){ int n,i; char a[1001][20];//不懂 while(cin>>n) { for(i=0; i<n; i++) cin>>a[i]; for(i=0; i<n; i++) { if(strcmp(a[i],"fork")==0) cout<<"fork ";//strcmp函数 if(strcmp(a[i],"chopsticks")==0) cout<<"chopsticks "; if(strcmp(a[i],"bowl")==0) cout<<"bowl "; if(strcmp(a[i],"knife")==0) cout<<"knife "; } cout<<endl; } return 0;}#include<iostream>using namespace std;int main(){ int n,i; while (cin >> n) { string str;//不知道还可以用string定义 for (i = 0; i < n; i++) { cin >> str; if (str == "bowl" || str == "knife" || str =="fork" || str == "chopsticks") cout << str << " "; } cout << endl; }}
英语需要加强啊!
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 218Dinner<水>
- NYOJ 218 Dinner
- NYOJ 218 Dinner
- nyoj-218-Dinner
- nyoj 218 Dinner(水题)
- nyoj--218--Dinner(语法)
- NYOJ - 218 - Dinner(简单问题)
- NYOJ--Dinner
- C++虚函数表详细解释及实例分析
- Mac OS使用技巧十九:Safari碉堡功能之二查看网页源码
- HDU 4810 Wall Painting 异或性质
- 如何在android上 使用gif图片(android开源库android-gif-drawabl)
- 青蛙的约会 ---- 同余方程(数论)
- nyoj-218-Dinner
- 最简单的基于FFmpeg的AVDevice例子(屏幕录制)
- ArcGIS for javascript 构建GraphicsLayer
- 效仿UNIX程序grep的实现方法改写模式查找程序
- 在Linux上安装zsh
- 计算机中重要的32个算法[转帖]
- linux VLAN实现代码研究
- webView 与js交互方法(参考文献)
- 【LeetCode】Path Sum