1005 Spell It Right (20 分)-PAT甲级

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.将1~9对应的英文用一个字符串数组存起来,可将数字转化成对应的英文

            2.数位和较大,用long long int 存

            3.分离数位并输出使用递归实现

#include <iostream>
#include <string> 
using namespace std;
string s[10]={"zero","one","two","three","four","five","six","seven","eight","nine"};
void number(int n);
int main()
{
	string ss;
	int temp;
	long long sum=0;
	cin>>ss;
	for(int i=0;i<ss.length();i++)
	{
		temp=ss[i]-'0';
		sum+=temp;
	}
	number(sum);
	return 0;
}
void number(int n)
{
	if(n>10)
	{
		number(n/10);
		cout<<" "<<s[n%10];
	}
	else
		cout<<s[n%10];
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值