浙大ZOJ PAT practice – 1005

                                          PAT practice - 1005
Spell It Right (20)
Time Limit: 1 Second Memory Limit: 32768 KB
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

#include #include #include using namespace std;int main(){    string str;    cin>> str;    int sum=0;    int i=0;    for(;str[i]!='/0';i++)    sum+=str[i]-'0';   //计算每个数的和    stringstream ssum; //将int转换为string    ssum<>str;   i=0;   int num=0;   for(;str[i]!='/0';i++){   cout<<((i==0)?"":" ");//除第一个数除外 输出空格    num=str[i]-'0';   switch(num){   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;    case 0 : cout<<"zero"; break;   } }  return 0;   }