PAT乙级1002
[https://www.patest.cn/contests/pat-b-practise/1002 ] (传送门QWQ)
题目分析:
首先当然就是要用一个string数组存放0~9的拼音表示。这题是根据大数加法演变而来。大数加法在之前的博客有讲。也是用string实现。然后把总和的每一位数存储起来。最后和之前所存储的拼音数组元素一一对应。这道题的思路和实现也比较的简单。可以动手做一做。QWQ
代码如下:
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
string number[10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
int main(){
string s;
cin>>s;
long long int sum=0;
for(int i=0;i<s.size();i++){
sum+=s[i]-'0';
}
// cout<<sum<<endl;
vector<int>key;
while(sum){
key.push_back(sum%10);
sum/=10;
}
reverse(key.begin(),key.end());
for(int i=0;i<key.size()-1;i++){
cout<<number[key[i]]<<" ";
}
cout<<number[key[key.size()-1]];
return 0;
}