1005. Spell It Right (20)——PAT (Advanced Level) Practise

SpellItRight 英文数字拼写

最新推荐文章于 2022-05-13 11:38:51 发布

原创最新推荐文章于 2022-05-13 11:38:51 发布 · 940 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，转载请标明出处 http://blog.youkuaiyun.com/xianyun2009

文章标签：

#Advanced Level #PAT #1005 #Spell It Right

浙大PAT 同时被 2 个专栏收录

106 篇文章

订阅专栏

浙大Pat

106 篇文章

订阅专栏

本文介绍了一个计算非负整数各位数字之和，并将该和的每个数字用英文单词输出的编程问题。文章提供了一段使用 C++ 实现的示例代码，通过堆栈逆序输出英文单词来解决此问题。

题目信息：

1005. Spell It Right (20)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 <stack>
#include <iterator>
#include <algorithm>
using namespace std;

int main()
{
	char *str[10] = { "zero", "one", "two", "three", "four", "five",
		"six", "seven", "eight", "nine" };
	unsigned int sum = 0;
	char ch[101];
	cin >> ch;
	for (int i = 0; ch[i] != '\0'; i++)
	{
		sum += ch[i] - '0';
	}
	stack<int> res;
	if (sum == 0)
		res.push(0);
	while (sum)
	{
		res.push(sum % 10);
		sum /= 10;
	}
	cout << str[res.top()];
	res.pop();
	while (!res.empty())
	{
		cout << " " << str[res.top()];
		res.pop();
	}
	cout << endl;
	return 0;
}