PAT 1005 Spell It Right
题目:
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 100 10^{100} 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
解题思路:
在外面声明一个string类型的hash table用来存放常量;
- 一定要定义一个string类型的变量来存储输入的数据,long long类型的也会溢出。
- 循环遍历输入的input的每个值,然后减去’0’之后做加和
- 最终对应相应的hash中的值挨个替换成英文。
代码:
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
string numberStr[] = {"zero","one","two","three","four","five","six","seven","eight","nine"};
int main(){
string input_num;
cin >> input_num;
long long result = 0;
string input_str = input_num;
//计算各个部分的和
int i;
for(i=0;i<input_str.length();i++){
result += (input_str[i]-'0');
}
string result_str = to_string(result);
for(i=0;i<result_str.length();i++){
int current_index = result_str[i]-'0';
if(i < (result_str.length()-1)){
cout << numberStr[current_index] << " ";
}else{
cout << numberStr[current_index];
}
}
return 0;
}