甲级PAT 1082 Read Number in Chinese （字符串处理，中国式读数）

1082 Read Number in Chinese （25 分）

Given an integer with no more than 9 digits, you are supposed to read it in the traditional Chinese way. Output Fu first if it is negative. For example, -123456789 is read as Fu yi Yi er Qian san Bai si Shi wu Wan liu Qian qi Bai ba Shi jiu. Note: zero (ling) must be handled correctly according to the Chinese tradition. For example, 100800 is yi Shi Wan ling ba Bai.

Input Specification:

Each input file contains one test case, which gives an integer with no more than 9 digits.

Output Specification:

For each test case, print in a line the Chinese way of reading the number. The characters are separated by a space and there must be no extra space at the end of the line.

Sample Input 1:

-123456789

Sample Output 1:

Fu yi Yi er Qian san Bai si Shi wu Wan liu Qian qi Bai ba Shi jiu

Sample Input 2:

100800

Sample Output 2:

yi Shi Wan ling ba Bai

题目要求 

将数字转化为按格式的拼音输出

解题思路

首先判断输入的数是否为0，是就直接输出0

然后判断输入的数是否为负数，是就输出"Fu "，然后将该数变为正数

中文的读法是将数字分成节

XXXX,XXXX,XXXX （均不为0的情况）

 X千X百X十X亿X千X百X十X万X千X百X十

每四个一节，每节里面的处理是一样的，最后加亿或者是万

但是较为复杂的是要考虑其中0的情况

1. 例如1,0020,0000这种情况，yi Yi ling er Shi Wan（1亿零二十万），2前面输出1个0,2后面的0不输出，0有时候输出有时候不输出，可以设置一个检测位zero，表示非0数字的高位是否需要输出0
2. 例如0,0000,0008 这种情况，ba，8前不输出0，如果仅用检测位判断无法判断出，判断当前位为0的时候，前面是否不全为0。

• 举例如0,0001,0008 （从右往左）对于第7位的0，10008/10000000 = 0 所以即使是满足不是一节的最后一位以及zero为false,也不能表示高位有0。但是对于第3位的0,10008/1000 = 10,此时是可以保存高位为0的

注意

1.空格的输出。要保证格式，第一个输出的无论是零还是数字都必须前面没有空格，而后面输出的零或数字都需要加空格

2.每一小节对应的亿或者万要在个位输出之后输出，且必须该节不为0

完整代码

#include<bits/stdc++.h>
using namespace std;

int main(){
	string m[10] = {"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"};
	string c[6] = {" ", "Shi", "Bai", "Qian", "Yi", "Wan"};
	int v[9] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000};
	int n,i,j,part[3];
	cin >> n;
	if (n == 0){
		cout << "ling";
		return 0;
	}
	if (n < 0){
		cout << "Fu ";
		n=-n; 
	}
	part[0] = n / v[8];
	part[1] = n % v[8] / v[4];
	part[2] = n % v[4];
	bool zero = false;
	int printCnt = 0;
	for (i = 0; i < 3; i++){
		int temp = part[i];
		for (j = 3; j >=0; j--){
			int pos = 8 - i * 4 + j;
			if (pos > 8 ) continue;  
			int cur = (temp / v[j]) % 10;
			if (cur != 0){
				if (zero){
					printCnt++ == 0 ? cout<<"ling" : cout<<" ling";
					zero = false;
				}
				if (j == 0) printCnt++ == 0 ? cout<<m[cur] : cout<<" "<<m[cur];
				else printCnt++ == 0 ? cout<<m[cur]<<" "<<c[j] : cout<<" "<<m[cur]<<" "<<c[j];
			}else{
				if(!zero && j !=0 && n / v[pos] >= 10) zero = true;
			}
		}
		if(i!=2 && part[i] > 0) cout<<" "<<c[i+4];
	}
	return 0;
}