渣渣ACM日记——1013-Digital Roots (HDOJ)
来源:互联网 发布:java注释规范 编辑:程序博客网 时间:2024/06/11 16:59
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57658 Accepted Submission(s): 18000
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//刚开始做用Int存初始数据被坑了 ,题目没说多长的数,所以用一个字符串来保存 假设字符串一亿个,每个都是9,第二次也不会超出Int ,所以后面不用转换成字符串#include <iostream>#include <string>using namespace std;int main(){int j; string s; while(cin>>s){ if(s=="0") break; int i=0; for(j=0;s[j]!='\0';j++) i+=s[j]-'0'; if(i<10) cout<<i<<endl; else { int tmp=i; while(tmp>9){ i=tmp; tmp=0; while(i!=0){ tmp+=i%10; i/=10; } } cout<<tmp<<endl; }} return 0;}
0 0
- 渣渣ACM日记——1013-Digital Roots (HDOJ)
- 杭电acm—1013 Digital Roots
- HDOJ 1013 Digital Roots
- HDOJ 1013 Digital Roots
- HDOJ 1013 Digital Roots
- HDOJ 1013 Digital Roots
- hdoj 1013 Digital Roots
- HDOJ 1013 Digital Roots
- hdoj 1013 Digital Roots
- HDOJ 1013 Digital Roots
- hdoj-1013-Digital Roots
- hdoj 1013Digital Roots
- 【HDOJ】【1013】Digital Roots
- HDOJ 1013 Digital Roots
- HDOJ 1013 Digital Roots
- HDOJ 1013 Digital Roots
- hdoj 1013 Digital Roots
- HDOJ 1013 Digital Roots
- Erlang的常驻模块与功能模块
- SAP审计
- CSU1608: Particle Collider(后缀数组)
- Extjs4 grid动态获取列的实现
- 教你做GRE的新旧观点型阅读
- 渣渣ACM日记——1013-Digital Roots (HDOJ)
- Lightoj 1009. K-based Numbers(DP)
- hihoCoder#1037 : 数字三角形(DP)
- 要用心去感受这个世界
- 工厂模式
- EXT 隐藏TBAR
- REST框架简介
- 相关sql
- android启动模式对于体验的影响