• 蓝桥杯 报时助手


    问题描述
      给定当前的时间,请用英文的读法将它读出来。
      时间用时h和分m表示,在英文的读法中,读一个时间的方法是:
      如果m为0,则将时读出来,然后加上“o'clock”,如3:00读作“three o'clock”。
      如果m不为0,则将时读出来,然后将分读出来,如5:30读作“five thirty”。
      时和分的读法使用的是英文数字的读法,其中0~20读作:
      0:zero, 1: one, 2:two, 3:three, 4:four, 5:five, 6:six, 7:seven, 8:eight, 9:nine, 10:ten, 11:eleven, 12:twelve, 13:thirteen, 14:fourteen, 15:fifteen, 16:sixteen, 17:seventeen, 18:eighteen, 19:nineteen, 20:twenty。
      30读作thirty,40读作forty,50读作fifty。
      对于大于20小于60的数字,首先读整十的数,然后再加上个位数。如31首先读30再加1的读法,读作“thirty one”。
      按上面的规则21:54读作“twenty one fifty four”,9:07读作“nine seven”,0:15读作“zero fifteen”。
    输入格式
      输入包含两个非负整数h和m,表示时间的时和分。非零的数字前没有前导0。h小于24,m小于60。
    输出格式
      输出时间时刻的英文。
    样例输入
    0 15
    样例输出
    zero fifteen
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main() {
     4     map<int, string> m;
     5     m[0] = "zero", m[1] = "one", m[2] = "two", m[3] = "three", m[4] = "four";
     6     m[5] = "five", m[6] = "six", m[7] = "seven", m[8] = "eight", m[9] = "nine";
     7     m[10] = "ten", m[11] = "eleven", m[12] = "twelve", m[13] = "thirteen", m[14] = "fourteen";
     8     m[15] = "fifteen", m[16] = "sixteen", m[17] = "seventeen", m[18] = "eighteen", m[19] = "nineteen";
     9     m[20] = "twenty", m[30] = "thirty", m[40] = "forty", m[50] = "fifty";
    10     int hh, mm;
    11     cin >> hh >> mm;
    12     if (mm == 0) {
    13         if (hh <= 20) {
    14             cout << m[hh] << " o'clock" << endl;
    15         } else {
    16             cout << m[20] << " " << m[hh - 20] << " o'clock" << endl;
    17         }
    18     } else {
    19         if (hh <= 20) {
    20             cout << m[hh] << " ";
    21         } else {
    22             cout << m[20] << " " << m[hh - 20] << " ";
    23         }
    24         if (mm <= 20) {
    25             cout << m[mm] << endl;
    26         } else {
    27             int k = mm % 10;
    28             cout << m[mm - k] << " " << m[k] << endl;
    29         }
    30     }
    31     return 0; 
    32 } 
  • 相关阅读:
    17. Letter Combinations of a Phone Number java solutions
    43. Multiply Strings java solutions
    3. Longest Substring Without Repeating Characters java solutions
    51. N-Queens java solutions
    74. Search a 2D Matrix java solutions
    48. Rotate Image java solutions
    64. Minimum Path Sum java solutions
    leetcode : Container With Most Water
    leetcode : reverse integer
    leetcode : ZigZag Conversion
  • 原文地址:https://www.cnblogs.com/fx1998/p/12807025.html
Copyright © 2020-2023  润新知