The Famous Clock

最新推荐文章于 2025-06-16 14:28:30 发布

标哥-iOS攻城狮

最新推荐文章于 2025-06-16 14:28:30 发布

阅读量672

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM语言入门

本文链接：https://blog.youkuaiyun.com/woaifen3344/article/details/8041880

ACM语言入门专栏收录该内容

48 篇文章

订阅专栏

本文介绍了一款帮助用户将罗马数字转换为十进制数的程序，适用于ACM-ICPC世界总决赛前的训练时间管理场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The Famous Clock

时间限制： 1000 ms | 内存限制： 65535 KB

难度： 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

查看代码---运行号：252406----结果：Accepted

运行时间： 2012-10-05 19:47:00 | 运行人: huangyibiao

    01.
    #include <string>
   
    02.
    #include <iostream>
   
    03.
    usingnamespace std;
   
    04.
     
    05.
    intmain()
   
    06.
    {
   
    07.
    string s;
   
    08.
    intcount = 0;
   
    09.
    while(cin >> s)
   
    10.
    {
   
    11.
    cout <<"Case " << ++count  << ": ";
   
    12.
    if(s == "I")
   
    13.
    cout <<"1\n";
   
    14.
    elseif (s == "II")
   
    15.
    cout <<"2\n";
   
    16.
    elseif (s == "III")
   
    17.
    cout <<"3\n";
   
    18.
    elseif (s == "IV")
   
    19.
    cout <<"4\n";
   
    20.
    elseif (s == "V")
   
    21.
    cout <<"5\n";
   
    22.
    elseif (s == "VI")
   
    23.
    cout <<"6\n";
   
    24.
    elseif (s == "VII")
   
    25.
    cout <<"7\n";
   
    26.
    elseif (s == "VIII")
   
    27.
    cout <<"8\n";
   
    28.
    elseif (s == "IX")
   
    29.
    cout <<"9\n";
   
    30.
    elseif (s == "X")
   
    31.
    cout <<"10\n";
   
    32.
    elseif (s == "XI")
   
    33.
    cout <<"11\n";
   
    34.
    elseif (s == "XII")
   
    35.
    cout <<"12\n";
   
    36.
    }
   
    37.
    return0;
   
    38.
    }