ACM-水题之Digital Roots——hdu1013
来源:互联网 发布:php新闻发布系统源码 编辑:程序博客网 时间:2024/05/17 07:05
好吧,这几天刷一些水题找找感觉,
发现,一段时间不练,水平下降好多啊,
做个水题都磨蹭半天了。。。。
Digital Roots
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
够水的题吧,我原来程序是这样的:
#include <iostream>using namespace std;int main(){int n,j;while(cin>>n&&n!=0&&n>0){do{j=0;while(n>9){j+=n%10;n/=10;}j+=n;n=j;}while(n>9);cout<<n<<endl;}return 0;}
怎么看,怎么没有错,就是WA,我快崩溃了>_<!
后来才发现没有考虑大数的问题。。。。题目中也没有说数有多大,挺坏的。。。
所以,改正后:
#include <iostream>#include <string.h>using namespace std;int main(){char a[10000];int i,j,sum;while(cin>>a&&a[0]!='0'){sum=0;for(i=0;i<strlen(a);++i)sum+=(a[i]-'0');if(sum<10){cout<<sum<<endl;continue;}do{j=0;while(sum>9){j+=sum%10;sum/=10;}j+=sum;sum=j;}while(sum>9);cout<<sum<<endl;}return 0;}
- ACM-水题之Digital Roots——hdu1013
- Digital Roots—HDU1013
- HDU1013——Digital Roots
- HDU1013 Digital Roots
- hdu1013 Digital Roots
- hdu1013 Digital Roots
- hdu1013(Digital Roots)
- HDU1013 Digital Roots
- hdu1013-Digital Roots
- hdu1013 Digital Roots
- hdu1013 Digital Roots
- hdu1013:Digital Roots
- hdu1013 Digital Roots 数论
- hdu1013 Digital Roots
- HDU1013 Digital Roots
- HDU1013 Digital Roots
- HDU1013 Digital Roots
- HDU1013 POJ1519 Digital Roots
- 当在navigationBar的右侧添加按钮时有空隙,除掉间隔
- AndroidManifest.xml 的属性
- CListCtrl使用详解
- error code [17059]; 无法转换为内部表示
- C++:STL标准入门汇总
- ACM-水题之Digital Roots——hdu1013
- openstack cinder中的iscsitarget和tgt
- 黑马程序员-交通灯系统
- HDOJ 1025 Constructing Roads In JGShining's Kingdom
- 事件对象CEvent使用
- 将椭圆形图像归一化为圆形图像
- ARM异常向量表中LDR指令、LDR伪指令的来龙去脉
- 2694:逆波兰表达式
- vs项目上传svn保留