HDOJ 1013
来源:互联网 发布:艾宾浩斯记忆软件 编辑:程序博客网 时间:2024/05/18 01:22
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30962 Accepted Submission(s): 9508Problem DescriptionThe 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. InputThe 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. OutputFor each integer in the input, output its digital root on a separate line of the output. Sample Input24390 Sample Output63
阅读全文
0 0
- HDOJ 1013
- HDOJ 1013
- HDOJ 1013
- HDOJ 1013
- HDOJ--1013
- HDOJ 1013
- hdoj 1013
- hdoj 1482 poj 1013
- 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
- 关键字explicit
- mysql的记录
- 数据结构四双向链表
- 关于实训周记
- android中通过GET方法接收数据并通过xml解析数据,POST方法向服务器提交数据
- HDOJ 1013
- codeforces 808A Lucky Year
- Java Set集合使用方法介绍(1)——在集合中插入字符串
- jsp内置对象
- HDOJ 1012
- 翻硬币
- springmvc+mybatis+redis的maven项目
- Linux- 一-软件安装-(20170512)
- HDOJ 1008