顽强的小白
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
题目解析
给一个超大范围中的数字,让我们计算结果然后用英文输出结果
思路:
- 数字的储存方式采用字符串最好,容易知道长度,int是肯定存不下
- 英文字母不要错
- 有0的结果要单独写
代码实现
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
char num[10][6]={"zero","one","two","tree","four","five","six","seven","eight","nine"};
char n[105];
int sum=0,len;
scanf("%s",n);
len=strlen(n);
for(int j=0;j<len;++j){
sum+=(n[j]-'0');
}
int s[100];
int i=0;
if(sum==0){
printf("zero");
return 0;
}
while(sum!=0){
s[i++]=sum%10;
sum=sum/10;
}
for(int j=i-1;j>=0;--j){
if(j!=i-1) printf(" ");
printf("%s",num[s[j]]);
}
return 0;
}