PAT (Advanced Level) 1082. Read Number in Chinese (25)

模拟题。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;

string num[]=
{
    "ling","yi","er","san","si",
    "wu","liu","qi","ba","jiu"
};
string tmp="";
string ans="";
string s="";

string f(string TMP)
{
    if(TMP[]==''&&TMP[]==''&&TMP[]==''&&TMP[]=='') return "ling";
    string t="";
    int p;
    for(int i=TMP.length()-;i>=;i--)
        if(TMP[i]!='') {p=i; break;}

    for(int i=;i<=p;i++) t=t+TMP[i];

    if(t==""  ) return "ling";

    if(t.length()==) return "ling";
    if(t.length()==) return num[t[]-''];
    if(t.length()==)
    {
        if(t[]=='') return num[t[]-'']+" Shi";
        return num[t[]-'']+" shi "+num[t[]-''];
    }
    if(t.length()==)
    {
        if(t[]==''&&t[]=='') return num[t[]-'']+" Bai";
        if(t[]==''&&t[]!='') return num[t[]-'']+" Bai "+num[t[]-'']+" Shi";
        if(t[]!=''&&t[]=='') return num[t[]-'']+" Bai ling "+num[t[]-''];
        if(t[]!=''&&t[]!='') return num[t[]-'']+" Bai "+num[t[]-'']+" Shi "+num[t[]-''];
    }
    if(t.length()==)
    {
        if(t[]==''&&t[]==''&&t[]=='') return num[t[]-'']+" Qian";
        if(t[]!=''&&t[]==''&&t[]=='') return num[t[]-'']+" Qian ling "+num[t[]-''];
        if(t[]==''&&t[]!=''&&t[]=='') return num[t[]-'']+" Qian ling "+num[t[]-'']+" Shi";
        if(t[]!=''&&t[]!=''&&t[]=='') return num[t[]-'']+" Qian ling "+num[t[]-'']+" Shi "+num[t[]-''];
        if(t[]==''&&t[]==''&&t[]!='') return num[t[]-'']+" Qian "+num[t[]-'']+" Bai";
        if(t[]!=''&&t[]==''&&t[]!='') return num[t[]-'']+" Qian "+num[t[]-'']+" Bai ling "+num[t[]-''];
        if(t[]==''&&t[]!=''&&t[]!='') return num[t[]-'']+" Qian "+num[t[]-'']+" Bai "+num[t[]-'']+" Shi";
        if(t[]!=''&&t[]!=''&&t[]!='') return num[t[]-'']+" Qian "+num[t[]-'']+" Bai "+num[t[]-'']+" Shi "+num[t[]-''];
    }
}

int main()
{
    cin>>tmp;
    int len=tmp.length();
    for(int i=;i<len/;i++)
        swap(tmp[i],tmp[len-i-]);

    if(tmp[tmp.length()-]=='-') ans=ans+"Fu ";

    for(int i=;i<tmp.length();i++)
    {
        if(tmp[i]=='-') continue;
        else s=s+tmp[i];
    }

    if(s.length()==)
    {
        string s1,s2,s3;

        string g="";
        g=g+s[]+s[]+s[]+s[];
        s2=f(g);

        g="";
        g=g+s[]+s[]+s[]+s[];
        s3=f(g);

        ans=ans+num[s[s.length()-]-'']+" Yi";

        if(s2=="ling") {}
        else
        {
            ans=ans+" ";
            if(s[]=='') ans=ans+"ling ";
            ans=ans+s2;
            ans=ans+" Wan";
        }

        if(s3=="ling"){}
        else
        {
            ans=ans+" ";
            if(s[]=='') ans=ans+"ling ";
            ans=ans+s3;
        }
    }
    else if(s.length()>=&&s.length()<=)
    {
        string s2;
        string s3;

        int len=s.length();
        for(int i=len;i<;i++) s=s+'';

        string g;
        g=g+s[]+s[]+s[]+s[];
        s2=f(g);

        g="";
        g=g+s[]+s[]+s[]+s[];
        s3=f(g);

        ans=ans+s2;
        ans=ans+" Wan";

        if(s3=="ling"){}
        else
        {
            ans=ans+" ";
            if(s[]=='') ans=ans+"ling ";
            ans=ans+s3;
        }

    }
    else if(s.length()<=)
    {
        string s3;

        int len=s.length();
        for(int i=len;i<;i++) s=s+'';

        string g;
        g=g+s[]+s[]+s[]+s[];
        s3=f(g);

        ans=ans+s3;
    }

    cout<<ans<<endl;

    return ;
}