hdu 1013 Digital Roots(模拟 || 数论)
来源:互联网 发布:淘宝怎查被隐形降权 编辑:程序博客网 时间:2024/04/29 21:30
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1013
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 59645 Accepted Submission(s): 18661
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
可以模拟,就是不断相加,相邻数字最大和不过是9+9=18,所以可以从左到右不断消灭,直到最后一位,比如:2381-->0581-->0131-->0041-->0005。结果就是5。
也可以发现循环节,利用这个特点得到答案。
模拟:
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int maxn=1e4+10;char str[maxn];int main(){ while(~scanf("%s",str)&&str[0]!='0'){ int i,length=strlen(str),q1,q2; for(i=1;i<length;i++){ int res=str[i-1]-'0'+str[i]-'0'; if(res>=10){ q1=res/10; q2=res%10; res=q1+q2; } str[i-1]=0; str[i]=res+'0'; } printf("%c\n",str[length-1]); } return 0;}数论:
/*number: 1 2 3 4 5 6 7 8 9 10 11 12 13……18 19 20 21 22 23 24……100 101 102 103 104……108 109 110……root: 1 2 3 4 5 6 7 8 9 1 2 3 4…… 9 1 2 3 4 5 6…… 1 2 3 4 5…… 9 1 2……循环节就是9!*/#include <iostream>#include <cstdio>#include <cstring>using namespace std;char str[1010];int main(){ while(~scanf("%s",str)&&str[0]!='0'){ int sum=0; int i,length=strlen(str); for(i=0;i<length;i++){ sum+=str[i]-'0'; } printf("%d\n",(sum-1)%9+1); } return 0;}
0 0
- hdu 1013 Digital Roots(模拟 || 数论)
- HDU 1013 Digital Roots(数论)
- POJ 1519 && HDU 1013 Digital Roots(数论)
- ACM 数论 hdu 1013 Digital Roots
- HDU1013 Digital Roots 模拟&数论(我不会数论)
- HDU 1013.Digital Roots【模拟或数论】【8月16】
- 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
- 各种杂项组件(3)之--CalendarView(日历视图)、DatePicker/TimePicker(日期、时间选择器)、NumberPicker(数值选择器)
- PAT 1081. Rational Sum (20)
- hdu1060 Leftmost Digit
- JohnsonTroter 排列生成算法
- #牛客#代码实现:二叉树的序列与反序、逆栈、链表回文、MaxTree
- hdu 1013 Digital Roots(模拟 || 数论)
- 数据库锁机制
- lintcode-硬币排成一条线
- 迭代器模式(二):迭代器模式概述
- 面试题_64——数据流中的中位数
- JAVA面试(未完)
- at org.apache.jsp.admin.index_jsp._jspInit(index_jsp.java:29)的解决方法
- 1023. 组个最小数
- Linux系统中valgrind检查内存泄露