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#include #include 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; }