The Famous Clock

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

链接：
http://acm.nyist.net/JudgeOnline/problem.php?pid=484
分析：
字符和整数的一一对应关系的表达。
代码：

#include <iostream>
#include <stdio.h>
#include <map>
#include <string.h>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
map<string,int> m;

int main(int argc, char** argv) {
    m["I"] = 1;
    m["II"] = 2;
    m["III"] = 3;
    m["IV"] = 4;
    m["V"] = 5;
    m["VI"] = 6;
    m["VII"] = 7;
    m["VIII"] = 8;
    m["IX"] = 9;
    m["X"] = 10;
    m["XI"] = 11;
    m["XII"] = 12;

    char in[5];
    int count = 1;
    while(scanf("%s",in)!=EOF){
        //Case 11: 11
        printf("Case %d: %d\n",count++,m[in]);
    }
    return 0;
}