PAT甲级 A1082

PAT甲级 A1082

题目详情

1082 Read Number in Chinese (25分)
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

解题思路

这道题最简单的方法就是枚举。总共只有九位，枚举个十百千万十万百万千万亿，需要注意枚举的过程中设置一个位存储此时的万是否输出过，避免重复输出。零的输出需要判断相邻只输出一次，邻在末尾相邻不输出
以下为AC代码

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
#include<iomanip>
#include<queue>
#include<cmath>
using namespace std;
string numbers[10] = { "ling","yi","er","san","si","wu","liu","qi","ba","jiu" };
int main(){
	string a; cin >> a;
	vector<string> ques;
	int tp = a.size()-1;
	int sz = 1; int beginz = 0;
	int wbz = 0; int ybz = 0;
	for (int i = a.size() - 1; i >= 0; i--) {
		if (i == 0 && a[i] == '0') {
			ques.push_back("ling");
			break;
		}
		if (i == 1 && a[i] == '0' && a[0] == '-') {
			ques.push_back("ling");
			break;
		}
		if (a[i] == '-') {
			ques.push_back("Fu");
			break;
		}
		if (a[i] == '0') {
			if (beginz == 0) {
				continue;
			}
			if (sz == 0) {
				continue;
			}
			else{
				ques.push_back("ling");
				sz = 0;
			}
		}
		else {
			if (beginz == 0) {
				beginz = 1;
			}
			if (sz == 0) {
				sz = 1;
			}
			if (i == tp) {//个位
				int pos = a[i] - '0';
				ques.push_back(numbers[pos]);
			}
			else if (i == tp-1) {//十位
				int pos = a[i] - '0';
				ques.push_back("Shi");
				ques.push_back(numbers[pos]);
			}
			else if (i == tp-2) {//百位
				int pos = a[i] - '0';
				ques.push_back("Bai");
				ques.push_back(numbers[pos]);

			}
			else if (i == tp-3) {//千位
				int pos = a[i] - '0';
				ques.push_back("Qian");
				ques.push_back(numbers[pos]);
			}
			else if (i == tp-4) {//万位
				int pos = a[i] - '0';
				ques.push_back("Wan");
				wbz = 1;
				ques.push_back(numbers[pos]);
			}
			else if (i == tp-5) {//十万位
				int pos = a[i] - '0';
				if (wbz != 1) {
					ques.push_back("Wan");
					wbz = 1;
				}
				ques.push_back("Shi");
				ques.push_back(numbers[pos]);
			}
			else if (i == tp-6) {//百万位
				int pos = a[i] - '0';
				if (wbz != 1) {
					ques.push_back("Wan");
					wbz = 1;
				}
				ques.push_back("Bai");
				ques.push_back(numbers[pos]);

			}
			else if (i == tp-7) {//千万位
				int pos = a[i] - '0';
				if (wbz != 1) {
					ques.push_back("Wan");
					wbz = 1;
				}
				ques.push_back("Qian");
				ques.push_back(numbers[pos]);

			}
			else if (i == tp-8) {
				int pos = a[i] - '0';
				ques.push_back("Yi");
				ybz = 1;
				ques.push_back(numbers[pos]);
			}
			else {
				int pos = a[i] - '0';
				if (ybz != 1) {
					ques.push_back("Yi");
				}
				ques.push_back("Shi");
				ques.push_back(numbers[pos]);
			}
		}
	}
	for (int i = ques.size() - 1; i >= 0; i--) {
		if (i == 0) {
			cout << ques[i] << '\n';
			break;
		}
		cout << ques[i] << " ";
	}
}