【PAT - 甲级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:

Sample Output:

one five

解题报告：

考察就是递归输出而已。注意输出格式的控制。

AC代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define FF first
#define SS second
#define ll long long
#define pb push_back
#define pm make_pair
using namespace std;
typedef pair<int,int> PII;
const int MAX = 2e5 + 5;
ll ans;
char s[MAX];
char db[10][102] = {"zero","one","two","three","four","five","six","seven","eight","nine"};
void out(ll x) {if(x <= 9) printf("%s",db[x]);else {out(x/10); printf(" %s",db[x%10]);}
}
int main()
{cin>>s+1;int len = strlen(s+1);for(int i = 1; i<=len; i++) {ans += s[i] - '0';}out(ans);return 0;
}

【PAT - 甲级1005】Spell It Right (20分) （递归输出，水题）相关推荐

PAT甲级 -- 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 e ...
【PAT】1005 Spell It Right (20 分)——字符串处理
//要么处理字符串,要么就数字分解,都想到了没有有效组合 //我的解法1:加法结果还是int,最后逆序分解数字,按序插入#include <iostream> #include <s ...
PAT甲级1005 Spell it Right 【20】【字符串操作】
1005 Spell It Right (20分) 题目要求 Given a non-negative integer N, your task is to compute the sum of al ...
PAT甲级1005 Spell It Right ：[C++题解]字符串处理
文章目录题目分析题目链接题目分析 ac代码 #include<bits/stdc++.h> using namespace std;const int N =110;string n ...
PAT甲级 1027 Colors in Mars (20分)
1027 Colors in Mars (20分) 题目链接:PAT A 1027 题目大意:给出三个十进制数,都是在[0-168]范围内,要求将他们转化为13进制后按顺序输出. 思路分析:非常简单的 ...
PAT甲级 -- 1148 Werewolf - Simple Version (20 分)
Werewolf(狼人杀) is a game in which the players are partitioned into two parties: the werewolves and th ...
1005 Spell It Right (20 分)——13行代码Ac
立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 Given a non-negative integer N, your task is to compute the sum o ...
【PAT甲级 StringBuilder的使用】1005 Spell It Right (20 分) Java版 7/7通过
题目挺简单的,是个水题坑 & 心得一开始switch (i)忘了写case 0的情况,导致两个测试点没通过,不过很快就发现了 int 类型的 sum 转换为 str 的方式:用空字符串拼 ...
【PAT (Advanced Level) Practice】1005 Spell It Right (20 分)
#include<iostream> #include<cstdio> #include<cstdlib> #include<string> #incl ...
【PAT甲级约会】1061 Dating (20 分) C++ 全部AC
题目这个题要注意的细节很多.因为一个星期有七天,一天有24小时,所以要注意字母范围这个隐藏条件,不符合条件的字母要跳过. 还要注意:第二次查找,要接着第一次找到的位置开始找.这个有点坑,题目里没说明 ...