hdoj1013
来源:互联网 发布:天书中文网软件下载 编辑:程序博客网 时间:2024/05/17 04:07
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)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
Source
Greater New York 2000
# include <iostream># include <string>using namespace std;int digit(int number){ int sum=0; while(number>=10){ sum+=number%10; number/=10; } sum+=number; return sum;}int main(void){ string num; while(cin>>num&&num!="0"){ int number=0; for(int i=0;i<num.size();i++) number+=num[i]-'0'; while(number>=10) number=digit(number); cout<<number<<endl; } return 0;}
- hdoj1013
- HDOJ1013
- hdoj1013
- hdoj1013
- hdoj1013
- HDOJ1013
- HDOJ1013水题
- { ioccc }hdoj1013
- HDOJ1013 Digital Roots
- hdoj1013简单题
- HDOJ1013 Digital Roots
- HDOJ1013大数处理
- hdoj1013(简单题)
- HDOJ1013 Digital Roots
- HDOJ1013 Digital Roots(高精度+数位分离求和)
- conversion to dalvik format failed with error 1的解决办法
- python多进程网络服务器
- TreeView加载数据库数据的三种方法实现三级联动
- js时间字符串与时间对象的转化及时间差值
- 项目优化
- hdoj1013
- MVC(JSP+JavaBean+Servlet),用户登录验证开始
- 【通信】数据通信网络
- As Long As You Love Me
- 如何操作3D中的摄像机
- 国际化
- objective-C中#pragma mark
- 枚举
- smarty常用变量操作符