#include <cstdio>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<vector>
using namespace std;
vector<char*> shu;
int main()
{
// freopen("G://test.txt","r",stdin);
char n[15];
char *s;
char num[11][8]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu","shi"};
vector<char*> nu(num,num+11);
char danwei[6][8]={"","Shi","Bai","Qian"};
vector<char*> danwe(danwei,danwei+6);
char dadanwei[3][8]={"","Wan","Yi"};
vector<char*> dadanwe(dadanwei,dadanwei+3);
while(scanf("%s",n)!=EOF){
shu.clear();
if(n[0]=='-'){
printf("Fu ");
s=n+1;
}
else if(n[0]=='0'){
printf("ling\n");
continue;
}
else
s=n;
int len=strlen(s);
int flag=0;
for(int i=0;i<len;++i){
if(s[i]!='0'){
if(flag==1){
shu.push_back(nu[0]);
flag=0;
}
shu.push_back(nu[s[i]-'0']);
if((len-i-1)%4!=0)
shu.push_back(danwe[(len-i-1)%4]);
if((len-i-1)/4!=0&&(len-i-1)%4==0)
shu.push_back(dadanwe[(len-i-1)/4]);
}
else{
flag=1;
if((len-i-1)/4!=0&&(len-i-1)%4==0)
shu.push_back(dadanwe[(len-i-1)/4]);
}
}
for(int i=0;i<shu.size();++i){
if(i!=shu.size()-1){
printf("%s ",shu[i]);
}
else
printf("%s\n",shu[i]);
}
}
return 0;
}
PAT 1082
最新推荐文章于 2025-03-19 19:08:27 发布