PAT_A1005 | Spell It Right-CSDN博客

本文链接：https://blog.csdn.net/weixin_43787043/article/details/104247205

1005 Spell It Right (20point(s))

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 (≤10100).

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

由于最多100位数，就算每一位都是9，最大也就900。所以说加和的最终结果最多三位。

那么直接分类输出即可：三位、两位、一位（0也算一位）。

具体代码如下：

//
// Created by LittleCat on 2020/2/10.
//

#include <cstdio>


#define N 105

int main() {
    char number[10][6] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
    char input[N];
    scanf("%s", input);

    int ans = 0;
    for (int i = 0; input[i] != '\0'; i++)
        ans += input[i] - '0';

    if (ans >= 100)
        printf("%s %s %s\n", number[ans / 100],number[ans % 100 /10], number[ans %10]);
    else if(ans >= 10)
        printf("%s %s\n", number[ans / 10], number[ans % 10]);
    else
        printf("%s\n", number[ans]);

    return 0;
}