【笨方法学PAT】1005 Spell It Right（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

二、题目大意

给一个数字，求各位数字之和 sum，输出 sum 各个位上的数字对应的英文。

三、考点

string

PS. string 与 int 的互相转换，可以参考：【笨方法学PAT】string 与 int 的互相转换

四、解题思路

1、将每个数字对应的英文单词保存到 string 数组中；

2、string 读入（10^1000次方）；

3、求和，int 类型

4、将和转为string；

5、遍历string输出。

【注意】PAT对数字的各种“奇奇怪怪”的处理，转为 string 比较合适！

五、代码

#include<iostream>
#include<string>
using namespace std;
int main() {
	string eng[10] = { "zero","one","two","three","four","five","six","seven","eight","nine"};
	string s;
	cin >> s;
	int sum = 0;
	//求和
	for (int i = 0; i < s.length(); ++i)
		sum += s[i] - '0';

	//输出
	string t = to_string(sum);
	for (int i = 0; i < t.length(); ++i) {
		if (i != 0)
			cout << " ";
		cout << eng[t[i] - '0'];
	}

	system("pause");
	return 0;
}