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

最新推荐文章于 2025-09-23 10:17:01 发布

原创最新推荐文章于 2025-09-23 10:17:01 发布 · 153 阅读

0 ·

CC 4.0 BY-SA版权

PAT 甲级专栏收录该内容

41 篇文章

订阅专栏

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

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:

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;
}