# 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 all the digits of N, and output every digit of the sum in English.

Each input file contains one test case. Each case occupies one line which contains an N (<= 10100).

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.

12345

one five

PAT链接

### 思路：

1.二维数组存单词：

char convert[10][6] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};

2.统计各位数字之和，从个位开始入栈

    // 统计字串各位数数字和
for(int i = 0; i < len; i++)
{
sum += str[i] - '0';
}
// 每一位入栈再pop出来
do
{
st.push(sum % 10);
cnt++;
sum /= 10;
} while (sum != 0);

### 代码：

/**
* @tag     PAT_A_1005
* @authors R11happy (xushuai100@126.com)
* @date    2016-8-28 00:08-00:24
* @version 1.0
* @Language C++
* @Ranking  340/2590
* @function null
*/

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <stack>
using namespace std;

char convert[10][6] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};

int main(int argc, char const *argv[])
{
stack<int> st;
char str[110];
gets(str);
int len = strlen(str);
int sum = 0;
int cnt = 0;    //记录入栈个数
// 统计字串各位数数字和
for(int i = 0; i < len; i++)
{
sum += str[i] - '0';
}
// 每一位入栈再pop出来
do
{
st.push(sum % 10);
cnt++;
sum /= 10;
} while (sum != 0);
for(int i = 0; i<cnt-1; i++)
{
printf("%s ",convert[st.top()] );
st.pop();
}
printf("%s",convert[st.top()] );
st.pop();
return 0;
}


### 收获：

1.声明

#include <stack>
using namespace std;

2.定义

    char str[110];

3.push
4.top, pop

• 本文已收录于以下专栏：

c++实现

## [PAT]1005. Spell It Right (20)

/************************************************************** 1005. Spell It Right (20) 时间限制 400 ...

## PAT1005. Spell It Right (20)

1005. Spell It Right (20)时间限制400 ms 内存限制65536 kB 代码长度限制16000 B 判题程序Standard作者CHEN, Yue Given a non-n...

## 【PAT (Advanced Level)】1005. Spell It Right (20)

1005. Spell It Right (20) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B...

## 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 A1005 Spell It Right

//解答和我想的是一样的，要注意是二维数组的map即可 //输出change的那里一开始写成了%c，警示！ //第一次提交，有一个3分的点错误 //第二次提交，除了0那个测试点其他全部错误，发现把...

## 浙大 PAT Advanced level 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 e...

## 1005. Spell It Right (20)

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)