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

本文介绍了一个简单的程序,该程序接收一个非负整数N作为输入,计算其所有数字的总和,并将每个数字的英文单词形式输出。示例输入为12345,输出则为onefive。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

1005 Spell It Right (20)(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 (<= 10^100^).

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
# include <iostream>
# include <string>
# include <sstream>
using namespace std;

void int_to_string(int &a, string &str){
	stringstream stream;
	stream << a;
	str = stream.str();
}

int main(){
	int sum = 0;
	string str1, str2;
	string array[10] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"}; 
	cin >> str1;
	for(int i = 0; i < str1.length(); i++){
		sum += str1[i] - '0';
	}
	str2 = to_string(sum); 
//	int_to_string(sum, str2); 
	cout << array[str2[0] - '0'];
	for(int i = 1; i < str2.length(); i++)
		cout << ' ' << array[str2[i] - '0'];
		
	return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值