nyoj 484-The Famous Clock

最新推荐文章于 2022-02-10 23:21:39 发布

转载最新推荐文章于 2022-02-10 23:21:39 发布 · 75 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/GetcharZp/p/9346407.html

本文介绍了一道关于将罗马数字转换为十进制数字的编程题。题目要求参赛者为一位无法理解罗马数字的选手编写代码，将时钟上的罗马数字时间转换成易于理解的十进制时间。通过解析罗马数字的表示方式，使用字符串比较的方法，实现了快速准确的转换。

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 }

转载于:https://www.cnblogs.com/GetcharZp/p/9346407.html