PAT日志 1005

顽强的小白

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;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值