PAT (Advanced Level) 1082. Read Number in Chinese (25) 数字转汉字大写
2015-07-30 13:48
483 查看
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:
Sample Output 1:
Sample Input 2:
Sample Output 2:
("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
分成高1位、中4位、低4位进行处理。注意中间有多个0重复只输出一个"ling",末尾和前缀都不能输出"ling"。/*2015.7.30cyq*/ #include <iostream> #include <string> #include <vector> using namespace std; string num[11]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"}; string danwei[4]={"","Shi","Bai","Qian"}; int main(){ int N; cin>>N; if(N==0){ cout<<"ling"; return 0; } vector<string> result; if(N<0){ result.push_back("Fu"); N=-N; } int high=N/100000000; int mid=N/10000%10000; int low=N%10000; int tmp=mid; if(high>0){ result.push_back(num[high]); result.push_back("Yi"); } if(mid>0){//中间4位 vector<int> tmp(4); tmp[0]=mid%10; tmp[1]=mid%100/10; tmp[2]=mid%1000/100; tmp[3]=mid/1000; for(int i=3;i>=1;i--){ if(tmp[i]>0){ result.push_back(num[tmp[i]]); result.push_back(danwei[i]); }else{//tmp[i]==0 if(!result.empty()){//避免0前缀或0重复 if(result.back()!="ling"&&result.back()!="Fu") result.push_back("ling"); } } } if(tmp[0]>0) result.push_back(num[tmp[0]]);//最低位无单位 while(result.back()=="ling")//去掉末尾的0 result.erase(result.end()-1); result.push_back("Wan"); } if(low>0){//低4位 if(high>0&&mid==0) result.push_back("ling"); vector<int> tmp(4); tmp[0]=low%10; tmp[1]=low%100/10; tmp[2]=low%1000/100; tmp[3]=low/1000; for(int i=3;i>=1;i--){ if(tmp[i]>0){ result.push_back(num[tmp[i]]); result.push_back(danwei[i]); }else{//tmp[i]==0 if(!result.empty()){//避免0前缀或0重复 if(result.back()!="ling"&&result.back()!="Fu") result.push_back("ling"); } } } if(tmp[0]>0) result.push_back(num[tmp[0]]);//最低位无单位 while(result.back()=="ling")//去掉末尾的0 result.erase(result.end()-1); } cout<<result[0]; for(auto it=result.begin()+1;it!=result.end();it++) cout<<" "<<*it; return 0; }
相关文章推荐
- 28. JavaScript 库
- Swift教程(一)
- ROS进阶学习手记 8 -- 认识tf
- .NET默认参数的用法
- 性能分析工具gprof介绍
- 笛卡尔树 POJ ——1785 Binary Search Heap Construction
- 不错的插件,以后可以借用
- 学习认识Spring原理
- C#调用命令行返回参数方法
- [基本实验] 拖库
- IOS开发系列—Objective-C之内存管理详解
- ACM比赛中通过freopen读取测试用例
- 【剑指Offer面试题】 九度OJ1517:链表中倒数第k个结点
- 隐藏UINavigationBar下面的一个像素的阴影
- Managing your Applications在同一个CI中设置多个application文件夹
- Java在的时候,类定义HashSet初始化方法
- 语音信号临界带宽的概念解释
- Can you find it?(二分 二分+STL set map)
- 关于操作符和函数的区别
- ViewDragHelper详解