PAT 甲级 1005. Spell It Right（递归模拟）

最新推荐文章于 2022-03-31 17:24:43 发布

zp_jit

最新推荐文章于 2022-03-31 17:24:43 发布

阅读量140

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/zpjlkjxy/article/details/79814422

版权

算法专栏收录该内容

113 篇文章 0 订阅

订阅专栏

1005. Spell It Right (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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:

Sample Output:

one five

分析：题目意思就是求一个数的每位数字之后，然后转换成英文，没啥好说的。水题。

#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
void prt(int c,int flag)
{
	if(flag==0)cout<<" ";
	switch(c){
		case 0:cout<<"zero";break;
		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;
	}
}
void dfs(int c)//习惯用递归的方式从高位往地位输出 
{
	if(c<10){//最高位，flag置为1，这样不输出空格。 
		prt(c,1);
		return;
	}
	dfs(c/10);//递归上一层之后再输出 
	prt(c%10,0);
}
int main()
{
	string s;
	cin>>s;
	int sum=0;
	for(int i=0;i<s.size();i++)
		sum+=s[i]-'0';//相加 
	dfs(sum);//用递归输出 
	return 0;
}