题目描述
解题思路:我的解法较为麻烦是通过求出每个数位上的数字来求解的;代码如下:
#include <iostream>
#include <cstring>
using namespace std;
char N[120];
int main() {
void search(int i);
void suan(int n);
cin >> N;
int sum = 0;
for (int i = 0; i < strlen(N); i++)
sum += N[i] - '0';
suan(sum);
}
void suan(int n) {
if (n > 9)
suan(n / 10);
if (n > 9)
cout << " ";
search(n % 10);
}
void search(int i) {
switch (i) {
case 0:
cout << "zero";
break;
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;
}
}