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;
}

打个小广告

欢迎加入我的知识星球「基你太美」,我会在星球中分享 AucFrame 框架、大厂面经、AndroidUtilCode 更详尽的说明…一切我所了解的知识,你可以通过支付进入我的星球「基你太美」进行体验,加入后优先观看星球中精华的部分,如果觉得星球的内容对自身没有收益,你可以自行申请退款退出星球,也没必要加我好友;如果你已确定要留在我的星球,可以通过扫描如下二维码(备注:基你太美+你的星球昵称)加我个人微信,方便我后续拉你进群(PS:进得越早价格越便宜)。

我的二维码