hdu-oj 1013 Digital Roots
来源:互联网 发布:java导出excel 进度条 编辑:程序博客网 时间:2024/05/28 18:44
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 48434 Accepted Submission(s): 15053
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题目大意:把一个数各位拆分相加直到sum<10;解题思路:定义字符串然后利用指针各位相加;因为输出各位相加sum<=9,根据“中国剩余定理”直接对 9 取余。附代码:#include <stdio.h>char s[10000];int main() { char *p; int d; while (scanf("%s", s) > 0) { p = s; d = 0; while (*p) { //对于大数,直接求一次各位的和。 d += *p - '0'; ++p; } if (d == 0) break; //输入0,退出。 d %= 9; if (d == 0) d = 9; //整除取9. printf("%d\n", d); } return 0;}
0 0
- hdu-oj 1013 Digital Roots
- hdu-oj 1013 Digital Roots
- Hdu oj 1013 Digital Roots
- HDU OJ Digital Roots 题目1013
- hdu oj 1013 Digital Roots 解题报告
- hdu oj 1013 Digital Roots(dfs)
- 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
- extjs assertions from selenium expectedconditions.java
- 数论的若干定理
- 基于Android手机的声波通信源代码
- dd
- Java集合实现原理
- hdu-oj 1013 Digital Roots
- crontab用法
- CENTOS 使用邮箱服务
- 快速排序与二分检索法合并实现。
- JAVA使用Dom4j实现字符串和xml文件相互转换
- LeetCode-Convert Sorted List to Binary Search Tree
- Linux NFS服务器的安装与配置
- Java版opencv使用中的一些错误原因--Highgui.imread()读不进图片
- 使用单例模式实现自己的HttpClient工具类