a1082 read number in chinese

1082 Read Number in Chinese

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

解答

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

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];
    cin.getline(str, 11);
    int length = strlen(str);
    int left = 0, right = length - 1; 
    if (str[0] == '-')
    {
        printf("Fu");
        left++;
    }

    while (left + 4 <= right) //right每次左移4位,直到left与right在同一节
        right -= 4;

    while (left < length) //每次处理数字的一节
    {
        bool flag = false;
        bool isPrint = false;
        while (left <= right) //从左至右处理某节的每一位
        {
            if (left > 0 && str[left] == '0') //当前位为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 == true && right != length - 1)
        {
            printf(" %s", wei[(length - 1 - right) / 4 + 2]);
        }
        right += 4;
    }
    return 0;
}