关闭

1005. Spell It Right (20)

标签: PAT
127人阅读 评论(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:
12345
Sample Output:
one five

提交代

#include <iostream>
#include<cstdio>
#include<string.h>
#include<cmath>
using namespace std;
int main()
{
	char a[10001];
	char b[10][10]={"zero","one","two","three","four","five","six","seven","eight","nine"};
	int c[11]={0};
	int sum=0;
	gets(a);
	int la=strlen(a);
	for(int i=0;i<la;i++)
	{
		sum+=a[i]-'0';
	}
	//cout<<sum<<endl;sum=15;
	int len=0;
	if(sum==0)
	{
		cout<<"zero";
		return 0;
	}
	while(sum)
	{
		c[len++]=sum%10;
		sum/=10;
	}
	
	for(int i=len-1;i>=0;i--)
	{
		cout<<b[c[i]];
		if(i!=0)
		cout<<" ";
	}
	return 0;
}

注意将英文字母处理成二维数组很简单

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:155399次
    • 积分:6275
    • 等级:
    • 排名:第4050名
    • 原创:483篇
    • 转载:0篇
    • 译文:0篇
    • 评论:80条
    最新评论