ÌâÄ¿ÈçÏ£º

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

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.

12345

one five

#include
  
   
#include
   
     #include
    
      #include
     
       using namespace std; int sumdigits(string data); template
      
        out convert(in a); int main() { string data; string digit[] = {"zero","one","two","three","four","five","six","seven","eight","nine"}; string temp; while(cin>>data) { temp = convert
       
        (sumdigits(data)); for(int i = 0; i < temp.length(); i++) { cout<
        
         (temp[i])]; if (i != temp.length() - 1) cout<<" "; } cout<
         
          (data[data.length()-1]); sum += sumdigits(data.substr(0, data.length() - 1)); return sum; } template
          
            out convert(in a) { stringstream temp; temp<
           
            >b; return b; }