1005. Spell It Right (20)

来源:互联网 发布:java软件测试 编辑:程序博客网 时间:2024/06/11 12:14

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<stdio.h>#include<iostream>#include<string>using namespace std;#define SIZE 1000int main(){string N;cin>>N;int sum = 0;for(int i = 0; i < N.size(); i++){sum += N[i]-'0'; }char tmp[SIZE];sprintf(tmp, "%d", sum);string str = tmp;for(int j = 0; j < str.size(); j++){if(j != 0){printf(" ");}switch(str[j]){case '0': printf("%s", "zero"); break;case '1': printf("%s", "one"); break;case '2': printf("%s", "two"); break;case '3': printf("%s", "three"); break;case '4': printf("%s", "four"); break;case '5': printf("%s", "five"); break;case '6': printf("%s", "six"); break;case '7': printf("%s", "seven"); break;case '8': printf("%s", "eight"); break;case '9': printf("%s", "nine"); break;}}return 0;}


原创粉丝点击