读入一个自然数n,计算其各位数字之和,用汉语拼音写出和的每一位数字。
输入格式:每个测试输入包含1个测试用例,即给出自然数n的值。这里保证n小于10^100。
输出格式:在一行内输出n的各位数字之和的每一位,拼音数字间有1 空格,但一行中最后一个拼音数字后没有空格。
输入样例:
1234567890987654321123456789
输出样例:
yi san wu
#include<iostream>
#include<string>
#include<vector>
using namespace std;
string match(int number){
string s;
switch(number){
case 1:
s = "yi"; break;
case 2:
s = "er"; break;
case 3:
s = "san"; break;
case 4:
s = "si"; break;
case 5:
s = "wu"; break;
case 6:
s = "liu"; break;
case 7:
s = "qi"; break;
case 8:
s = "ba"; break;
case 9:
s = "jiu"; break;
case 0:
s = "ling"; break;
}
return s;
}
int main(){
vector<string> ret;
string s;
cin >> s;
int len = s.size(), count = 0;
for(int i = 0; i < len; ++i){
char c = s[i];
count += (c-'0');
}
do{
ret.insert(ret.begin(), match(count%10));
count /= 10;
}while(count > 0 );
for(int i = 0; i < ret.size()-1; i++){
cout << ret[i] << ' ';
}
cout << ret[ret.size()-1];
// cout << count << endl;
return 0;
}
//一个比较简单的方法
#include <iostream>
#include<string>
using namespace std;
int main(){
string sign[] = {"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu", };
string s;
int count = 0;
cin >> s;
for(int i = 0; i < s.size(); ++i)
count += s[i]-'0'
string temp = to_string(count);
for(int i = 0; i < temp.size(); ++i){
if(i != 0) cout << ' ';
cout << sign[temp[i]-'0'];
}
return 0;
}