杭电OJ第4256题 The Famous Clock
来源:互联网 发布:美橙域名证书下载 编辑:程序博客网 时间:2024/09/21 08:50
杭电OJ第4256题,The Famous Clock(题目链接)。
The Famous Clock
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
Source
Fudan Local Programming Contest 2012
解题思路:遇到I输出1,遇到II输出2,……,遇到XII输出12。
C语言源代码如下:
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <assert.h>#include <stdbool.h>int main (void){ int test_case = 0; char roman_numeral[8]; while ( gets( roman_numeral ) != NULL ) { test_case ++; if ( !strcmp( roman_numeral, "I" ) ) printf( "Case %d: 1\n", test_case ); else if ( !strcmp( roman_numeral, "II" ) ) printf( "Case %d: 2\n", test_case ); else if ( !strcmp( roman_numeral, "III" ) ) printf( "Case %d: 3\n", test_case ); else if ( !strcmp( roman_numeral, "IV" ) ) printf( "Case %d: 4\n", test_case ); else if ( !strcmp( roman_numeral, "V" ) ) printf( "Case %d: 5\n", test_case ); else if ( !strcmp( roman_numeral, "VI" ) ) printf( "Case %d: 6\n", test_case ); else if ( !strcmp( roman_numeral, "VII" ) ) printf( "Case %d: 7\n", test_case ); else if ( !strcmp( roman_numeral, "VIII" ) ) printf( "Case %d: 8\n", test_case ); else if ( !strcmp( roman_numeral, "IX" ) ) printf( "Case %d: 9\n", test_case ); else if ( !strcmp( roman_numeral, "X" ) ) printf( "Case %d: 10\n", test_case ); else if ( !strcmp( roman_numeral, "XI" ) ) printf( "Case %d: 11\n", test_case ); else if ( !strcmp( roman_numeral, "XII" ) ) printf( "Case %d: 12\n", test_case ); else assert(false); } return EXIT_SUCCESS;}
- 杭电OJ第4256题 The Famous Clock
- 杭电OJ第4252题 A Famous City
- 杭电OJ第4247题 A Famous ICPC Team
- 杭电OJ第4245题 A Famous Music Composer
- 杭电OJ第4255题 A Famous Grid
- 南阳 oj 语言入门 The Famous Clock
- hdu 4256 The Famous Clock
- hdoj-4256-The Famous Clock
- NYOJ 484题 The Famous Clock
- The Famous Clock
- NYOJ - The Famous Clock
- The Famous Clock
- hdu4256 The Famous Clock
- The Famous Clock
- HDU4256:The Famous Clock
- The Famous Clock
- 484 The Famous Clock
- HUD4256 The Famous Clock
- 中南OJ 2012年8月月赛 I题 Imagination
- 杭电OJ第4247题 A Famous ICPC Team
- 大神与三位小伙伴问题解法
- 杭电OJ第4245题 A Famous Music Composer
- 学习4-Cocos2D-X UI系统
- 杭电OJ第4256题 The Famous Clock
- 杭电OJ第4255题 A Famous Grid
- NEUOJ第1155题 Mysterious Organization —— 顺便训练一下“正则表达式”
- 吉林大学OJ第2775题 Problem F: Shadows
- 杭电OJ第4018题 Parsing URL
- 杭电OJ第4011题 Working in Beijing
- 杭电OJ第4015题 Mario and Mushrooms
- ACM-ICPC Live Archive 第4889题 Post Office
- BNU OJ 第26303 题 Touchscreen Keyboard