zoukankan      html  css  js  c++  java
  • 简单枚举类型——植物与颜色-sdut

    简单枚举类型——植物与颜色

    Time Limit: 1000MS Memory Limit: 65536KB

    Problem Description

     请定义具有red, orange, yellow, green, blue, violet六种颜色的枚举类型color,根据输入的颜色名称,输出以下六种植物花朵的颜色:
    Rose(red), Poppies(orange), Sunflower(yellow), Grass(green), Bluebells(blue), Violets(violet)。如果输入的颜色名称不在枚举类型color中,例如输入purple,请输出I don't know about the color purple.
     

    Input

     输入数据有多行,每行有一个字符串代表颜色名称,颜色名称最多30个字符,直到文件结束为止。

    Output

     输出对应颜色的植物名称,例如:Bluebells are blue. 如果输入的颜色名称不在枚举类型color中,例如purple, 请输出I don't know about the color purple.
     

    Example Input

    blue
    yellow
    purple

    Example Output

    Bluebells are blue.
    Sunflower are yellow.
    I don't know about the color purple.

    Hint

     请用枚举类型实现。

    Author

     lxh
     
    实验代码
    #include<stdio.h>
    #include<string.h>
    enum color {Rose,Poppies,Sunflower,Grass,Bluebells,Violet};
    int main()
    {
        char s[31];
        int t;
        while(scanf("%s",s)!=EOF)
        {
            t=100;
            if(strcmp(s,"red")==0) t=0;
            else if(strcmp(s,"orange")==0) t=1;
            else if(strcmp(s,"yellow")==0) t=2;
            else if(strcmp(s,"green")==0) t=3;
            else if(strcmp(s,"blue")==0) t=4;
            else if(strcmp(s,"violet")==0) t=5;
            if(t>=0&&t<=5)
            {
                switch((enum color)t)
                {
                    case 0:printf("Rose are red.
    ");break;
                    case 1:printf("Poppies are orange.
    ");break;
                    case 2:printf("Sunflower are yellow.
    ");break;
                    case 3:printf("Grass are green.
    ");break;
                    case 4:printf("Bluebells are blue.
    ");break;
                    case 5:printf("Violets are violet.
    ");break;
                }
            }
            else printf("I don't know about the color %s.
    ",s);
        }
        return 0;
    }
    
  • 相关阅读:
    Happy Number
    N-Queens
    Palindrome Partitioning
    Linked List Cycle I & II
    leetcode 96: Unique Binary Search Trees java
    cc150 Chapter 2 | Linked Lists 2.6 Given a circular linked list, implement an algorithm which returns node at the beginning of the loop.
    cc150 Chapter 2 | Linked Lists 2.5 add two integer LinkedList, return LinkedList as a sum
    355. Design Twitter [classic design]
    400. Nth Digit
    211. Add and Search Word
  • 原文地址:https://www.cnblogs.com/lxhax/p/6628990.html
Copyright © 2011-2022 走看看