PAT甲级1005. Spell It Right (20)
来源:互联网 发布:代言宝无水印版源码 编辑:程序博客网 时间:2024/06/18 06:28
题目链接
https://www.patest.cn/contests/pat-a-practise/1005
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:12345Sample Output:
one five
思路分析
由于给定的数字较长,用字符数组存储,然后计算出和,再把和按每一位存储到字符数组,再遍历
注意 输入为0 时 输出 zero
代码
#include<iostream>#include<cstring>using namespace std;int main(){char a[101];char b[101];gets(a);//puts(a);int sum = 0;int i = 0;while(i!=strlen(a)){sum =sum + (a[i]-'0');i++;}int j = 0;if(sum == 0)cout<<"zero";else{while(sum){b[j] = sum%10+'0';sum/=10;j++;}for(int k = j-1;k >= 0;k--){if(b[k] == '0') cout<<"zero";if(b[k] == '1') cout<<"one";if(b[k] == '2') cout<<"two";if(b[k] == '3') cout<<"three";if(b[k] == '4') cout<<"four";if(b[k] == '5') cout<<"five";if(b[k] == '6') cout<<"six";if(b[k] == '7') cout<<"seven";if(b[k] == '8') cout<<"eight";if(b[k] == '9') cout<<"nine";if(k!=0) cout<<" ";}}cout<<endl;return 0;}
阅读全文
0 0
- PAT - 甲级 - 1005. Spell It Right (20)
- PAT甲级.1005. Spell It Right (20)
- 【PAT甲级】1005. Spell It Right (20)
- PAT甲级1005. Spell It Right (20)
- PAT甲级 1005. Spell It Right (20)
- PAT甲级1005. Spell It Right (20)
- PAT 甲级 1005. Spell It Right (20)
- PAT甲级1005. Spell It Right
- PAT 甲级 1005. Spell It Right
- [PAT-甲级]1005.Spell It Right
- PAT甲级1005. Spell It Right
- PAT 甲级 1005. Spell It Right
- 1005. Spell It Right (20)-PAT甲级真题
- 【PAT甲级】【C++】1005. Spell It Right (20)
- PAT TEST 甲级1005. Spell It Right (20)
- PAT(甲级)1005. Spell It Right (20)
- PAT甲级练习1005. Spell It Right (20)
- PAT甲级 1005:Spell it Right
- static静态块、构造函数。主方法的执行顺序!
- 简图记录-正则表达式原理与应用基础
- 【C语言】【unix c】进程资源的回收
- Redis常见使用场景
- SDUT-2055
- PAT甲级1005. Spell It Right (20)
- 【转】Rancher部署Træfik实现微服务的快速发现
- TCP空闲扫描原理
- POJ3713-Transferring Sylla
- SVM防止过拟合
- iOS view圆角设置同时又不影响子视图超出父视图部分显示
- VirtualBox相关问题
- 每日一诗词 —— 古诗十九首·其十
- 路灯