pat 甲级 1082 Read Number in Chinese

心态爆炸的一道题
我周六去考试要是也遇到这情况怎么办！！
一个多小时写出来格式错误+答案错误
崩溃

大佬的AC代码↓

#include <iostream>
#include <string>
#include <vector>
using namespace std;
string num[10] = { "ling","yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu" };
string c[6] = { "Ge","Shi", "Bai", "Qian", "Yi", "Wan" };
int J[] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000};
vector<string> res;
int main() {
    int n;
    cin >> n;
    if (n == 0) {
        cout << "ling";
        return 0;
    }
    if (n < 0) {
        cout << "Fu ";
        n = -n;
    }
    int part[3];
    part[0]= n / 100000000; 
    part[1]= (n % 100000000) / 10000;
    part[2] = n % 10000;
    bool zero = false; //是否在非零数字前输出合适的ling
    int printCnt = 0; //用于维护单词前没有空格，之后输入的单词都在前面加一个空格。
    for (int i = 0; i < 3; i++) {
        int temp = part[i]; //三个部分，每部分内部的命名规则都一样，都是X千X百X十X
        for (int j = 3; j >= 0; j--) {
            int curPos = 8 - i * 4 + j; //当前数字的位置
            if (curPos >= 9) continue; //最多九位数
            int cur = (temp / J[j]) % 10;//取出当前数字
            if (cur != 0) {
                if (zero) {
                    printCnt++ == 0 ? cout<<"ling" : cout<<" ling";
                    zero = false;
                }
                if (j == 0)
                    printCnt++ == 0 ? cout << num[cur] : cout << ' ' << num[cur]; //在个位，直接输出
                else                             
                    printCnt++ == 0 ? cout << num[cur] << ' ' << c[j] : cout << ' ' << num[cur] << ' ' << c[j]; //在其他位，还要输出十百千
            } else {
                if (!zero&&j != 0 && n / J[curPos] >= 10) zero = true;   //注意100020这样的情况
            }
        }
        if (i != 2 && part[i]>0) cout << ' ' << c[i + 4]; //处理完每部分之后，最后输出单位，Yi/Wan
    }
    return 0;
}

↓残缺代码

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>

using namespace std;

string a,b;
int wei,l;
string du[3] = {"Shi","Bai","Qian"};
string dui[10] = {"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};

int main(){

    cin >> a;
    l = a.length();
    bool key,flag;
    if(a[0] == '-'){
        printf("Fu ");
        b = a.substr(1,l);
        l = b.length();
    }
    else b = a;
    int k = 0;
    bool kong = true;
    if(l==9){
        cout << dui[b[0]-'0'];
        kong = false;
        printf(" Yi");
        l = l - 1;
        k = k + 1;
        flag = false;
    }

    if(l>4){
        bool qian = false;

        int c = l - 4;
        while(c != 1){
            int j = b.length(), p = c;
            for(int i=k; p>0; i++,p--){

                if(b[i] != '0') qian = true;                
            }
            //cout << qian << " qia " << endl;
            //cout << k << "  " << key << endl;
            if(b[k] == '0' && b[k-1] == '0' ) {
                if(flag != false){
                    k = k + 1;
                    c = c - 1;
                    qian = false;
                    continue;
                }
                flag = true;
            }
            if(qian){

                if(b[k] != '0')     cout << du[c-2] ;
                k = k + 1;
                c = c - 1;
                qian = false;
            }
            else break;

        }
        if(b[k] != '0') 
        cout << dui[b[k]-'0'];
        l = 4;
        printf("Wan ");
        key = false;
    }
    if(l <= 4){
        bool qian = false;
        k = k + 1;
        while(l != 1){
            int j = b.length(), p = l;
            for(int i=j-1; p>0; i--,p--){

                if(b[i] != '0') qian = true;                
            }
            //cout << qian << " qia " << endl;
            //cout << k << "  " << key << endl;
            if(b[k] == '0' && b[k-1] == '0' ) {
                if(key != false){
                    k = k + 1;
                    l = l - 1;
                    qian = false;
                    continue;
                }
                key = true;
            }
            if(qian){
                cout << dui[b[k]-'0'] ;
                if(b[k] != '0')     cout << du[l-2] ;
                k = k + 1;
                l = l - 1;
                qian = false;
            }
            else break;
        }
        if(b[k] != '0')
        cout << dui[b[k]-'0'];
    }

    return 0;
}