码迷,mamicode.com
首页 > 其他好文 > 详细

1005. Spell It Right (20)

时间:2018-03-11 11:53:10      阅读:185      评论:0      收藏:0      [点我收藏+]

标签:bsp   include   nta   char   com   分解   compute   seve   ret   

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

 

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<stdlib.h>
 4 
 5 char str[101];
 6 char out[][10]={"zero","one","two","three","four","five","six","seven","eight","nine"};
 7 int ans[10];  //最多100位,100*9=900
 8 int main()
 9 {
10     int len,sum=0,index=0;
11     int i;
12     gets(str);
13     len = strlen(str);
14     for( i=0; i<len; i++)
15         sum += str[i]-0;
16     while( sum ) //分解位数
17     {
18         ans[index++]=sum%10;
19         sum /= 10;
20     }
21     for( i=index-1; i>0; i--)
22         printf("%s ",out[ans[i]]);
23     printf("%s",out[ans[0]]);
24     return 0;
25 }

 

1005. Spell It Right (20)

标签:bsp   include   nta   char   com   分解   compute   seve   ret   

原文地址:https://www.cnblogs.com/yuxiaoba/p/8543040.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!