hdoj1013(简单题)
来源:互联网 发布:极小化极大算法 编辑:程序博客网 时间:2024/05/16 12:23
Digital Roots
Problem Description
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process is repeated. This is continued as long as necessary to obtain a single digit.
For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process must be repeated. Adding the 1 and the 2 yeilds 3, a single digit and also the digital root of 39.
For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process must be repeated. Adding the 1 and the 2 yeilds 3, a single digit and also the digital root of 39.
Input
The input file will contain a list of positive integers, one per line. The end of the input will be indicated by an integer value of zero.
Output
For each integer in the input, output its digital root on a separate line of the output.
Sample Input
24390
Sample Output
63
一开始定义的是输入整数,真是笨到家。
要注意题目没有规定数的大小!应该用字符串来输入数据。
(吐槽一下cfree5,没有include<string>,却没有报错。。。。)
#include<stdio.h> #include<iostream>#include<string>using namespace std;string str;int main(){int i,sum;while(cin>>str&&str!="0"){sum=0; for(i=0;i<str.length();i++) { sum+=str[i]-'0'; if(sum>9) { sum=sum/10+sum%10; } } cout<<sum<<endl;}return 0;}
阅读全文
0 0
- hdoj1013(简单题)
- hdoj1013简单题
- hdoj1013
- HDOJ1013
- hdoj1013
- hdoj1013
- hdoj1013
- HDOJ1013
- HDOJ1013 Digital Roots(高精度+数位分离求和)
- HDOJ1013水题
- { ioccc }hdoj1013
- HDOJ1013 Digital Roots
- HDOJ1013 Digital Roots
- HDOJ1013大数处理
- HDOJ1013 Digital Roots
- HDU2734(简单题)
- HDU1064(简单题)
- (水题)简单题
- Struts 1基础入门
- 如何做出亮闪闪的毕业设计PPT?
- Lambda表达式
- 运维记-第二周
- 2017驾校 科二考试流程
- hdoj1013(简单题)
- 神经网络算法
- 集合框架
- 《OpenGL超级宝典(第五版)》 在 VS2010 / VS2015中 的配置方法 +
- scikit-learn svm初探 分类:机器学习 Sklearn
- 【编程题】字符串编码
- JAVA数据类型
- java的类型
- 兔子跳跃之谜下(BZOJ2454 RabbitPuzzle(BZOJ中不是多组数据))