zoukankan      html  css  js  c++  java
  • 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 chopsticks
    2 bowl letter
    样例输出
    fork chopsticks
    bowl
    提示
    The tableware only contains: bowl, knife, fork and chopsticks.
    来源
    辽宁省10年省赛


    字符串匹配函数  strcmp(*a,*b)  if(true) return 0;
    自信
    #include<stdio.h>
    #include<string.h>
    int main()
    {
        int n,i;
        char a[5]="bowl",b[6]="knife",c[5]="fork",d[11]="chopsticks";
        char e[11];
        while(scanf("%d",&n)==1)
        {
            for(i=0;i<n;i++)
            {
                scanf("%s",e);
                if(strcmp(a,e)==0)
                printf("%s ",e);
                if(strcmp(b,e)==0)
                printf("%s ",e);
                if(strcmp(c,e)==0)
                printf("%s ",e);
                if(strcmp(d,e)==0)
                printf("%s ",e);
    
            }
            printf("
    ");
        }
        return 0;
    }
    View Code
  • 相关阅读:
    KVM WEB管理工具——WebVirtMgr(二)日常配置
    在阿里云上遇见更好的Oracle(四)
    Django源码分析之权限系统_擒贼先擒王
    Django源码分析之server
    Django源码分析之执行入口
    HDFS常用文件操作
    排查实时tail功能cpu占用过高问题
    ZooKeeper完全分布式安装与配置
    Hadoop2.5.2集群部署(完全分布式)
    构造器
  • 原文地址:https://www.cnblogs.com/asd1234/p/3384626.html
Copyright © 2011-2022 走看看