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.

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

思路：给你一个数，求每位相加之后的和，这个和每位用英文数字表示，简单的模拟，用了栈，注意0这个结果就满分了。

Code：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
using namespace std;
const int N=102;
char dig[][10]={"zero","one","two","three","four","five","six","seven","eight","nine"};
int main()
{
    char num[N];
    gets(num);
    int len=strlen(num);
    int sum=0;
    for(int i=0;i<len;i++)
        sum+=num[i]-'0';
    char stack[10][10];
    int top=-1;
    if(sum==0)
        cout<<dig[0];
    else
    {
        while(sum)
        {
            strcpy(stack[++top],dig[sum%10]);
            sum/=10;
        }
        cout<<stack[top--];
        while(top!=-1)
            cout<<" "<<stack[top--];
    }
    return 0;
}

打个小广告

欢迎加入我的小专栏「基你太美」一起学习。