PAT(甲) 1005. Spell It Right (20)

1005. Spell It Right (20)

题目地址：1005. Spell It Right (20)

题目描述：

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.

---

• 输入格式：
  Each input file contains one test case. Each case occupies one line which contains an N (<= 10100).

• 输出格式：
  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.

---

解题方法：
考虑到位数比较大，因此可以用字符数组接收，然后各位求和。

易错点：
1. 要考虑结果为2位数或者1位数。
2. 要考虑输入为0的处理。

---

程序：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void Print(int x)
{
    switch (x)
    {
        case 0: printf("zero"); break;
        case 1: printf("one"); break;
        case 2: printf("two"); break;
        case 3: printf("three"); break;
        case 4: printf("four"); break;
        case 5: printf("five"); break;
        case 6: printf("six"); break;
        case 7: printf("seven"); break;
        case 8: printf("eight"); break;
        case 9: printf("nine"); break;
    }
}

int main(int argc, char const *argv[])
{
    char Num[102];
    scanf("%s", Num);
    int len = strlen(Num), sum = 0, i, flag = 1;
    for (int i = 0; i < len; i++)
        sum += Num[i] - '0';
    int S[3];   /* 记录和 */
    /* 因为和最高为 900 */
    S[0] = sum / 100;
    S[1] = sum % 100 / 10;
    S[2] = sum % 10; 
    for (i = 0; i < 3 && S[i] == 0; i++);   /* 找到第一个不为0的数下标 */
    if (i == 3)
        Print(0);
    for (; i < 3; i++)
    {
        if (flag)
        {
            flag = 0;
            Print(S[i]);
        }
        else
        {
            printf(" ");
            Print(S[i]);
        }

    }
    return 0;
}