# NYOJ-484-The Famous Clock-2013年10月27日14:39:37

## The Famous Clock

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


# include<stdio.h>
# include<string.h>

int main()
{
int n=0;
char a[5];
while(~scanf("%s",a))
{
printf("Case %d: ",++n);
if(strcmp(a,"I")==0)
printf("1");
else if(strcmp(a,"II")==0)
printf("2");
else if(strcmp(a,"III")==0)
printf("3");
else if(strcmp(a,"IV")==0)
printf("4");
else if(strcmp(a,"V")==0)
printf("5");
else if(strcmp(a,"VI")==0)
printf("6");
else if(strcmp(a,"VII")==0)
printf("7");
else if(strcmp(a,"VIII")==0)
printf("8");
else if(strcmp(a,"IX")==0)
printf("9");
else if(strcmp(a,"X")==0)
printf("10");
else if(strcmp(a,"XI")==0)
printf("11");
else if(strcmp(a,"XII")==0)
printf("12");
printf("\n");
}

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

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

## 关于父子进程之间的问题！ 2011年10月27日11:36:01

#include #include #include int makeargv(char *s,char *delimits,char ***argvp) { char *t; c...

## The Famous Clock

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

## 2011年10月27日

/* 对任务及求解方法的描述部分 * 输入描述：个人月收入总额 * 问题描述：从2011年9月1日起，我国调整个人所得税起征点。基数上调为3500元，超出部分按以下7级计算。 * 1 超过0至1500...

## ShineScrum10月27日高端敏捷沙龙火热报名

ShineScrum10月27日高端敏捷沙龙火热报名         您是否一直苦心钻研敏捷流程却苦于没有机会和其他敏捷实践者面对面交流？您是否在敏捷的道路上遇到了各种问题却没有找到高手指点？现在...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)