#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
string s1;
int ans=0;
cin>>s1;
int len = s1.size();
for(int i=0;i<len;i++) {
ans+=s1[i]-'0';
}
string s=to_string(ans);
int len2 = s.size();
for(int i = 0;i<len2;i++ ){
switch(s[i])
{
case '1':
cout<<"one"<<" ";break;
case '2':
cout<<"two"<<" ";break;
case '3':
cout<<"three"<<" ";break;
case '4':
cout<<"four"<<" ";break;
case '5':
cout<<"five"<<" ";break;
case '6':
cout<<"six"<<" ";break;
case '7':
cout<<"seven"<<" ";break;
case '8':
cout<<"eight"<<" ";break;
case '9':
cout<<"nine"<<" ";break;
case '0':
cout<<"zero"<<" ";break;
}
}
}
思路:先将输入的字符串转换为int型,将其相减就得到了总和,在转换为字符串,一个个搜索对应的英文字母。