本文共 1160 字，大约阅读时间需要 3 分钟。

序：

Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.

Input Specification:

Each input file contains one test case. Each case occupies one line which contains an N (≤10​100​​).

Output Specification:

For each test case, output in one line the digits of the sum in English words. There must be one space between two consecutive words, but no extra space at the end of a line.

Sample Input:

12345

Sample Output:

one five

题目概述：

分析：

#include
   
    using namespace std;string dict[10] = {
   "zero","one","two","three","four","five","six","seven","eight","nine"};int main(){
       string str1;    cin >> str1;    int sum = 0;    for(int i = 0; i < str1.size(); i++)    {
           sum += str1[i] - '0';    }        string str2;    str2 = to_string(sum);    for(int i = 0; i < str2.size(); i++)    {
           if(i == 0) printf("%s", dict[str2[i] - '0'].c_str());        else printf(" %s", dict[str2[i] - '0'].c_str());    }    printf("\n");    return 0;}
   

总结：

转载地址：https://bridge-killer.blog.csdn.net/article/details/115421743 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！