mirror of
https://github.com/xlucn/PAT.git
synced 2026-08-20 22:11:24 +08:00
45 lines
1.0 KiB
C
45 lines
1.0 KiB
C
/**
|
|
* 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 (<= 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>
|
|
|
|
int main()
|
|
{
|
|
int sum = 0;
|
|
char c, *digits[] = {
|
|
"zero", "one", "two", "three", "four", "five",
|
|
"six", "seven", "eight", "nine"
|
|
};
|
|
|
|
while((c = getchar()) != '\n')
|
|
sum += c - '0';
|
|
|
|
if(sum >= 100)
|
|
printf("%s ", digits[sum / 100]);
|
|
if(sum >= 10)
|
|
printf("%s ", digits[sum % 100 / 10]);
|
|
printf("%s", digits[sum % 10]);
|
|
|
|
return 0;
|
|
}
|