1005. Spell It Right (20)

最新推荐文章于 2022-08-10 23:29:34 发布

原创最新推荐文章于 2022-08-10 23:29:34 发布 · 358 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #PAT #1005. Spell It Right

PAT(Advanced Level) 专栏收录该内容

103 篇文章

订阅专栏

本文详细解析了一个将非负整数转换为其英文单词形式的算法，包括输入和输出规范，以及核心实现步骤。

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¹⁰⁰).

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 <vector>
#include <unordered_map>
#include <cstdio>
#include <algorithm>

using namespace std;

vector<int> parse(string s){
	vector<int> result;

	for(auto& ch : s){
		result.push_back(ch - '0');
	}

	return result;
}

unordered_map<int, string> mapping = {
	{0, "zero"},	
	{1, "one"},
	{2, "two"},
	{3, "three"},
	{4, "four"},
	{5, "five"},
	{6, "six"},
	{7, "seven"},
	{8, "eight"},
	{9, "nine"}
};

bool first = true;

void print(long num){
	if(num == 0) return;

	int n = num % 10;

	print(num / 10);
	if(first) first = false;
	else printf(" ");
	printf("%s", mapping[n].c_str());
}

int main(){
	string s;
	cin >> s;

	auto result = parse(s);
	long sum = accumulate(result.begin(), result.end(), 0);
	
	if(sum == 0) printf("zero");
	else print(sum);

	return 0;
}