hdu 【1013】Digital Roots
来源:互联网 发布:淘宝导购怎么做 编辑:程序博客网 时间:2024/06/14 01:43
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66831 Accepted Submission(s): 20880
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
Recommend
We have carefully selected several similar problems for you: 1017 1021 1048 1020 1019
//虽然说用字符串也可以,但是题目说了用整数为什么不行呀!!人与人之间的信任呢!!#include <cstdio>#include <cstring>#include <iostream>using namespace std;char s[1005];int main(){ int n; while(scanf("%s", s) != EOF && s[0] != '0') { int sum = 0,n; for(int i = 0; i < strlen(s); i++) sum += s[i] - '0'; while(sum >= 10) { n = sum; sum = 0; while(n) { sum += n%10; n /= 10; } } printf("%d\n", sum); } return 0;}
1 0
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots
- hdu 1013 Digital Roots
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots
- hdu 1013 Digital Roots
- HDU 1013 Digital Roots
- hdu 1013 Digital Roots
- HDU--1013--Digital Roots
- hdu 1013 Digital Roots
- hdu 1013 Digital Roots
- HDU 1013Digital Roots
- HDU 1013 Digital Roots
- hdu 1013 Digital Roots
- hdu 1013 Digital Roots
- Digital Roots hdu 1013
- HDU 1013 Digital Roots
- JQuery日期插件datepicker的使用
- Tomcat配置参数详解
- oracle job
- SQLite 命令
- 使用ngrok让微信公众平台通过80端口访问本机
- hdu 【1013】Digital Roots
- unity3d的playmaker插件使用教程,九、playmaker和脚本
- #1040 : 矩形判断
- Hibernate Tools-代码生成
- 初识——java中的类与对象
- Android 异步消息处理机制 让你深入理解 Looper、Handler、Message三者关系
- 移动web异步上传图片
- JSTL标签 参考手册
- Codeforces Round #346 (Div. 2) C (贪心)