HDOJ 1013 Digital Roots(算是大数水题)
来源:互联网 发布:剑亭网络武侠小说 编辑:程序博客网 时间:2024/05/17 05:12
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58113 Accepted Submission(s): 18158
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
63ac代码:#include<stdio.h>#include<string.h>int main(){ int sum,k,i; char num[10005]; while(scanf("%s",num)!=EOF) { sum=0; if(num[0]=='0') break; else { for(i=0;i<strlen(num);i++) sum+=num[i]-'0'; while(sum>9) { k=0; while(sum) { k+=sum%10; sum/=10; } sum=k; } printf("%d\n",sum); } } return 0;}
0 0
- HDOJ 1013 Digital Roots(算是大数水题)
- HDU 1013 Digital Roots 大数水题
- HDOJ 1013题Digital Roots 大数,9余数定理
- 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 1013 Digital Roots
- hdoj-1013-Digital Roots
- hdoj 1013Digital Roots
- 【HDOJ】【1013】Digital Roots
- HDOJ 1013 Digital Roots
- HDOJ 1013 Digital Roots
- Java 操作 SQLite 数据库
- zhichi
- 两次装系统的经验
- 用C语言编写一系列简单的程序
- js里面的实例方法和静态方法
- HDOJ 1013 Digital Roots(算是大数水题)
- 线程之间的协作
- 颜色代码参考表
- [leetcode] 168.Excel Sheet Column Title
- Binary Tree Traversal (一)
- 杨绛百岁问答:何为好的教育,何为好的婚姻
- 用NodeJS搭建一个内容管理系统(v0.0.1)
- hdu 3448(搜索+剪枝)Bag Problem
- SQL数据库之将截断字符串或二进制数据 语句已终止