NYOJ484The Famous Clock
2012-08-02 14:40
176 查看
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
#include<stdio.h> #include<string.h> char str1[13][5]={"I","II","III","IV","V","VI","VII","VIII","IX","X","XI","XII"}; int main() { int i,k=1; char str[6]; while(gets(str)) { for(i=0;i<12;i++) if(strcmp(str1[i],str)==0) { printf("Case %d: %d\n",k++,i+1); break; } } return 0; }
相关文章推荐
- nyoj 93 汉诺塔(三)
- NYOJ73--比大小
- skiing(nyoj_10)
- NYOJ 60 谁获得了最高奖学金
- NYOJ 题目17 单调递增最长子序列 (DP)
- NYOJ47过河问题
- nyoj 19 擅长排列的小明<按序排列>
- nyoj 737 石子合并(一)(区间DP)
- nyoj-8-一种排序
- 判断图的连通性+一笔画问题(NYOJ 42 一笔画问题)
- NYOJ Binary String Matching
- nyoj 15 括号匹配(二)(区间DP)
- nyoj-71-孤舟上的旅行
- NYOJ40一笔画问题
- nyoj 108 士兵杀敌一
- NYOJ1023 还是回文(区间DP)
- nyoj 106 背包问题
- nyoj 448寻找最大数(贪心)
- nyoj_11 奇偶数分离
- nyoj 1023 还是回文(区间DP)