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

结尾无空行

题目大意:给出一个字符串,求各位数字之和,将结果的各位数字用英文打印

1: 感觉用python会更加快,读入必须是字符串,否则越界

2: 关于打印,一般有三种思路:

这三种方法考虑的优先程度是:to_string > 递归 > 倒叙数组

to_string(xxx):

#include<iostream>
using namespace std;
char* W[]={"zero","one","two","three","four","five","six","seven","eight","nine"};
int main(){
    string N;
    cin>>N;
    int sum=0;
    for(int i=0;i<N.length();i++){
        sum+=N[i]-'0';
    }
    string str=to_string(sum);
    cout<<W[str[0]-'0'];
    for(int i=1;i<str.length();i++){
        cout<<" "<<W[str[i]-'0'];
    }
}

递归

#include<iostream>
using namespace std;
char* W[]={"zero","one","two","three","four","five","six","seven","eight","nine"};
void Spell(int c){
    if(c<10){
        cout<<W[c];
        return;
    }
    Spell(c/10);
    cout<<" "<<W[c%10];
}
int main(){
    string N;
    cin>>N;
    int sum=0;
    for(int i=0;i<N.length();i++){
        sum+=N[i]-'0';
    }
    Spell(sum);
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值