1013:Digital Roots
来源:互联网 发布:电视直播软件有翡翠台 编辑:程序博客网 时间:2024/04/25 13:07
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45781 Accepted Submission(s): 14150
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
Source
Greater New York 2000
容易错的地方:将整数表示为整形。
#include <stdio.h>#include <string.h>int sumDig(int temp);int main(){char num[1000];int a[1000],sum,len,i;while(1){sum=0;gets(num);//先初始化和输入if(strcmp(num,"0")==0)break;len=strlen(num);for(i=0;i<len;i++) sum+=num[i]-'0'; while(sum>=10)sum=sumDig(sum); printf("%d\n",sum); }return 0;}int sumDig(int temp){int sum=0;while(temp!=0){ sum+=temp%10; temp=temp/10;}return sum;}
0 0
- HDU 1013 Digital Roots
- HDU 1013 Digital Roots
- 1013:Digital Roots
- hdu 1013 Digital Roots
- HDOJ 1013 Digital Roots
- HDU 1013 Digital Roots
- 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
- HDOJ 1013 Digital Roots
- hdu 1013 Digital Roots
- 1013 Digital Roots
- 1013 Digital Roots
- hdu 1013 Digital Roots
- boost vs2102
- NoSQL数据库的基础知识
- Maven3路程(一)环境搭建
- Mathematica 9设置C编译器
- basePath 的使用
- 1013:Digital Roots
- dsp C语言优化-(三)
- LeapYearFor
- flex编译的代码可以拷贝到java后台直接访问flex页面
- 通过管理账户的途径来使得计算机加速
- POJ 1556 The Doors(线段相交)
- 说说我对各种SEO培训的看法
- Problem Arrangement
- 宜信唐宁回应8亿坏账事宜,员工内部信曝光