题目地址

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 <iostream>
#include <vector>
#include<algorithm>
#include <cmath>
#include<map>
#include<cstring>
#include<queue>
#include<string>
#include<set>
#include<stack>
using namespace std;
typedef long long ll;
const int maxn=40010,inf=100000000;
const string book[13]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"},wei[6]={"Shi","Bai","Qian","Wan","Yi"};
int main(){
    string s;
    cin>>s;
    
    int len=s.length(),right=len-1,left=0;
    if(s[0]=='-'){
        cout<<"Fu" ;left++;
    }
    while(left+4<=right) right-=4;
    while(left<len){
        bool has_zero=0,print_wei=0;
        while(left<=right){
            if(s[left]=='0') has_zero=1;
            else{
                if(has_zero==1){
                    cout<<" ling";has_zero=0;
                }
                if(left>0) cout<<" ";
                cout<<book[s[left]-'0'];
                print_wei=1;
                if(left!=right) cout<<" "<<wei[right-left-1];
            }
            left++;
        }
        if(print_wei==1&&right!=len-1) cout<<" "<<wei[(len-1-right)/4+2];right+=4;
    }
    
}