1005. Spell It Right (20)

1. Spell It Right (20)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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

此题很简单，不涉及算法。
大意是：输入一个非负整数N，N< 10^1000,计算每一位加起来的和，得到sum，依次输出sum的每一位，用英文输出。

#include<iostream>#include<cstring>using namespace std;char number[11][20]={"zero","one","two","three","four","five","six","seven","eight","nine"};char num[10000];int num2[10000];int inde=0;int main(){    cin>>num;    int sum=0;    int len=strlen(num);    for (int i=0;i<len;i++)    {        sum+=num[i]-'0';    }    while(sum!=0)    {       num2[inde++]= sum%10;       sum/=10;    }    cout<<number[num2[inde-1]];    for (int i=inde-2;i>=0;i--)    {        cout<<" "<<number[num2[i]];    }    return 0;}