• nyoj 484-The Famous Clock


    484-The Famous Clock


    内存限制:64MB 时间限制:1000ms 特判: No
    通过数:2 提交数:2 难度:1

    题目描述:

    Mr. B, Mr. G and Mr. M are now in Warsaw, Poland, for the 2012’s ACM-ICPC World Finals Contest. They’ve decided to take a 5 hours training every day before the contest. Also, they plan to start training at 10:00 each day since the World Final Contest will do so. The scenery in Warsaw is so attractive that Mr. B would always like to take a walk outside for a while after breakfast. However, Mr. B have to go back before training starts, otherwise his teammates will be annoyed. Here is a problem: Mr. B does not have a watch. In order to know the exact time, he has bought a new watch in Warsaw, but all the numbers on that watch are represented in Roman Numerals. Mr. B cannot understand such kind of numbers. Can you translate for him?

    输入描述:

    Each test case contains a single line indicating a Roman Numerals that to be translated. All the numbers can be found on clocks. That is, each number in the input represents an integer between 1 and 12. Roman Numerals are expressed by strings consisting of uppercase ‘I’, ‘V’ and ‘X’. See the sample input for further information.

    输出描述:

    For each test case, display a single line containing a decimal number corresponding to the given Roman Numerals.

    样例输入:

    I
    II
    III
    IV
    V
    VI
    VII
    VIII
    IX
    X
    XI
    XII

    样例输出:

    Case 1: 1
    Case 2: 2
    Case 3: 3
    Case 4: 4
    Case 5: 5
    Case 6: 6
    Case 7: 7
    Case 8: 8
    Case 9: 9
    Case 10: 10
    Case 11: 11
    Case 12: 12

    C/C++   AC:

     1 #include <iostream>
     2 #include <algorithm>
     3 #include <cstring>
     4 #include <cstdio>
     5 #include <cmath>
     6 #include <stack>
     7 #include <set>
     8 #include <map>
     9 #include <queue>
    10 #include <climits>
    11 #include <bitset>
    12 #define PI 3.1415926
    13 
    14 using namespace std;
    15 const int MY_MAX = 35;
    16 string excel_str[14]={"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX", "X", "XI", "XII"};
    17 
    18 int main()
    19 {
    20     ios::sync_with_stdio(false);
    21     int cnt = 1;
    22     string my_str;
    23     while (cin >>my_str)
    24     {
    25         for (int i = 1; i <= 12; ++ i)
    26         {
    27             if (my_str == excel_str[i])
    28                 cout <<"Case " <<cnt ++ <<": " <<i <<endl;
    29         }
    30     }
    31 
    32     return 0;
    33 }
  • 相关阅读:
    383 Ransom Note 赎金信
    382 Linked List Random Node 链表随机节点
    381 Insert Delete GetRandom O(1)
    380 Insert Delete GetRandom O(1)
    378 Kth Smallest Element in a Sorted Matrix 有序矩阵中第K小的元素
    377 Combination Sum IV 组合之和 IV
    376 Wiggle Subsequence 摆动序列
    SpringBoot(十四):springboot整合shiro-登录认证和权限管理
    SpringBoot(十三):springboot 小技巧
    SpringBoot(十二):springboot如何测试打包部署
  • 原文地址:https://www.cnblogs.com/GetcharZp/p/9346407.html
Copyright © 2020-2023  润新知