UVa 11616 - Roman Numerals

題目：阿拉伯數字和羅馬數字轉化。

分析：模擬。直接計算即可，因為不能越級所以只有9和4判斷即可。

說明：好久沒刷題了，uhunt可以上了，╮(╯▽╰)╭。

#include <cstring>
#include <cstdio>

void roman(int bit, char C1, char C5, char C10)
{
	if (bit == 9) {
		printf("%c%c",C1,C10);
	}else {
		if (bit == 4) {
			printf("%c",C1);
		}
		if (bit >= 4) {
			printf("%c",C5);
			bit -= 5;
		}
		if (bit > 0 && bit <= 3) {
			while (bit) {
				printf("%c",C1);
				bit --;
			}
		}
	}	
}

int main()
{
	char buf[99];
	while (~scanf("%s",buf)) {
		if (buf[0] >= '0' && buf[0] <= '9') {
			int value = 0;
			for (int i = 0; buf[i]; ++ i)
				value = value*10 + buf[i]-'0';
			roman(value/1000    , 'M', ' ', ' ');
			roman(value%1000/100, 'C', 'D', 'M');
			roman(value%100/10  , 'X', 'L', 'C');
			roman(value%10      , 'I', 'V', 'X');
			puts("");
		}else {
			int ans = 0;
			for (int i = 0; buf[i]; ++ i) {
				if (buf[i] == 'C' && (buf[i+1] == 'M'||buf[i+1] == 'D')) ans -= 100;
				else if (buf[i] == 'X' && (buf[i+1] == 'C'||buf[i+1] == 'L')) ans -= 10;
				else if (buf[i] == 'I' && (buf[i+1] == 'X'||buf[i+1] == 'V')) ans -= 1;
				else if (buf[i] == 'M') ans += 1000;
				else if (buf[i] == 'D') ans += 500;
				else if (buf[i] == 'C') ans += 100;
				else if (buf[i] == 'L') ans += 50;
				else if (buf[i] == 'X') ans += 10;
				else if (buf[i] == 'V') ans += 5;
				else if (buf[i] == 'I') ans += 1;
			}
			printf("%d\n",ans);
		}
	} 
    return 0;
}