1082 Read Number in Chinese

解题代码

#include<cstdio>
#include<cstring>
char num[10][5] = { "ling","yi","er","san","si","wu","liu","qi","ba","jiu" };
char wei[5][5] = { "Shi","Bai","Qian","Wan","Yi" };
int main()
{
	char str[11];
	scanf("%s", str);
	int len = strlen(str);
	int left = 0, right = len - 1;
	if (str[0] == '-') {
		printf("Fu");
		left++;
	}
	while (left + 4 <= right) { right -= 4; }
	while (left < len) {
		bool flag = false;
		bool isPrint = false;
		while (left <= right) {
			if (left>0 && str[left] == '0') flag = true;
			else {
				if (flag) {
					printf(" ling");
					flag = false;
				}
				if (left > 0) printf(" ");
				printf("%s", num[str[left] - '0']);
				isPrint = true;
				if (left != right) printf(" %s", wei[right - left - 1]);
			}
			left++;
		}
		if (isPrint && right != len - 1) printf(" %s", wei[2 + (len - 1 - right) / 4]);
		right += 4;
	}
	return 0;
}

测试结果

问题整理

1.字符串处理。
2.该题是目前字符串处理最复杂的了，应用left和right简化了判断过程。