zoukankan      html  css  js  c++  java
  • cf 535 A. Tavas and Nafas

    A. Tavas and Nafas
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Today Tavas got his test result as an integer score and he wants to share it with his girlfriend, Nafas.

    His phone operating system is Tavdroid, and its keyboard doesn't have any digits! He wants to share his score with Nafas via text, so he has no choice but to send this number using words.

    He ate coffee mix without water again, so right now he's really messed up and can't think.

    Your task is to help him by telling him what to type.

    Input

    The first and only line of input contains an integer s (0 ≤ s ≤ 99), Tavas's score.

    Output

    In the first and only line of output, print a single string consisting only from English lowercase letters and hyphens ('-'). Do not use spaces.

    Sample test(s)
    input
    6
    output
    six
    input
    99
    output
    ninety-nine
    input
    20
    output
    twenty
    Note

    You can find all you need to know about English numerals in http://en.wikipedia.org/wiki/English_numerals .

    在考英语2333

    #include <iostream>
    
    using namespace std;
    
    int main()
    {
        int s,a,b;
        cin>>s;
        switch(s)
        {   case 0:cout<<"zero";return 0;
            case 10:cout<<"ten";return 0;
            case 11:cout<<"eleven";return 0;
            case 12:cout<<"twelve";return 0;
            case 13:cout<<"thirteen";return 0;
            case 14:cout<<"fourteen";return 0;
            case 15:cout<<"fifteen";return 0;
            case 16:cout<<"sixteen";return 0;
            case 17:cout<<"seventeen";return 0;
            case 18:cout<<"eighteen";return 0;
            case 19:cout<<"nineteen";return 0;
        }
        a = s /10;
        b = s%10;
        switch(a)
        {
            case 0:break;
            case 2:cout<<"twenty";break;
            case 3:cout<<"thirty";break;
            case 4:cout<<"forty";break;
            case 5:cout<<"fifty";break;
            case 6:cout<<"sixty";break;
            case 7:cout<<"seventy";break;
            case 8:cout<<"eighty";break;
            case 9:cout<<"ninety";break;
        }
        if (b!=0)
        {
            if (a!=0)
            cout<<"-";
            switch(b)
        {
            case 1:cout<<"one";break;
            case 2:cout<<"two";break;
            case 3:cout<<"three";break;
            case 4:cout<<"four";break;
            case 5:cout<<"five";break;
            case 6:cout<<"six";break;
            case 7:cout<<"seven";break;
            case 8:cout<<"eight";break;
            case 9:cout<<"nine";break;
        }
    
        }
        return 0;
    }
  • 相关阅读:
    鸽巢原理 学习笔记
    POJ 1811 Prime Test
    Ubuntu下pdf乱码问题解决方法
    POJ 基础数学
    SRM遇到的一个数论技巧——最大公约数和最小公倍数的关系
    计算几何初步模板
    矩阵快速幂 学习笔记
    ZOJ 2849 Attack of Panda Virus (优先队列 priority_queue)
    欧几里德算法和扩展欧几里德算法
    记部分HASH函数
  • 原文地址:https://www.cnblogs.com/111qqz/p/4427470.html
Copyright © 2011-2022 走看看