HDU4256:The Famous Clock

原创 2013年12月01日 21:19:05
Problem Description
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?
 

Input
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.
 

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

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

Sample Output
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
 


 

水题,不解释- -

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int main()
{
    char str[20][10] = {"#","I","II","III","IV","V","VI","VII","VIII","IX","X","XI","XII"};
    char s[10];
    int i,cas = 1;
    while(~scanf("%s",s))
    {
        for(i = 1;i<=12;i++)
        {
            if(strcmp(s,str[i])==0)
            {
                printf("Case %d: %d\n",cas++,i);
            }
        }
    }

    return 0;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

nyoj-484-The Famous Clock

The Famous Clock 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 Mr. B, Mr. G and Mr. M are now in War...
  • jtahstu
  • jtahstu
  • 2014年12月13日 18:05
  • 5366

NYOJ 484 The Famous Clock

The Famous Clock 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 Mr. B, Mr. G and Mr. M are n...

NYOJ484 The Famous Clock

The Famous Clock 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 Mr. B, Mr. G and Mr. M are now in Wars...

The Famous Clock

The Famous Clock 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 Mr. B, Mr. G and Mr. M are n...

HDU:4255 A Famous Grid(构造+BFS)

题意:给一个表,问两个位置之间的最短距离是多少,其中素数位置不能经过。 思路:坐标范围是10000,也就是说这个表大约是100*100,当然题目中表是无穷大的,由于有些位置不能走实际上可能会大于100...
  • kkkwjx
  • kkkwjx
  • 2015年04月18日 14:31
  • 485

BFS广搜——hdu 4255 A Famous Grid

点击打开链接                                     A Famous Grid Time Limit: 10000/3000 MS (Java/O...

【DP】 hdu4249 A Famous Equation

A Famous Equation http://acm.hdu.edu.cn/showproblem.php?pid=4249 Problem Description Mr...
  • ACM_Ted
  • ACM_Ted
  • 2012年08月06日 19:41
  • 539

hdu 42445A Famous Music Composer

A Famous Music Composer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java...

hdu 4251 The Famous ICPC Team Again(划分树裸题)

The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

HDU 4255A Famous Grid(裸BFS)

A Famous Grid Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
  • opm777
  • opm777
  • 2013年10月24日 21:46
  • 957
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU4256:The Famous Clock
举报原因:
原因补充:

(最多只允许输入30个字)