pta甲级1005 Spell It Right（AC）

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 (≤10100).

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

结尾无空行

思路：
1.先输入一组字符串。代表数字N。

2.将N的每一位加起来。

3.将求和得到的数字转为字符串类型。

4.用switch逐个判断每个位上分别是什么，输出答案。 

#include<bits/stdc++.h>
using namespace std;

int main()
{
	char str1[105],str2[105];
	int total=0,flag=0;
	cin>>str1;
	int len=strlen(str1);
	for(int i=0;i<len;i++){
		total+=str1[i]-'0';
	}
	sprintf(str2,"%d",total);
	int len2=strlen(str2);
	for(int i=0;i<len2;i++){
		if(flag==1) cout<<' ';
		switch(str2[i]){
			case '0': cout<<"zero"; break;
			case '1': cout<<"one"; break;
			case '2': cout<<"two"; break;
			case '3': cout<<"three"; break;
			case '4': cout<<"four"; break;
			case '5': cout<<"five"; break;
			case '6': cout<<"six"; break;
			case '7': cout<<"seven"; break;
			case '8': cout<<"eight"; break;
			case '9': cout<<"nine"; break;
		}
		flag=1;
	}
}