hdu 1013 Digital Roots
来源:互联网 发布:windows xp 原版 编辑:程序博客网 时间:2024/06/05 20:32
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 48348 Accepted Submission(s): 15029
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,就继续求‘和’的每一个数位上的数字之和。
#include<stdio.h>#include<string.h>int find(int sum){int ans=0; while(sum){ans+=sum%10;sum=sum/10;}return ans;}int main (){int sum,ans;int i,j;char a[100005];while(~scanf("%s",a)&&a[0]!='0'){sum=0;for(i=0;i<strlen(a);i++)sum+=(a[i]-'0');while(sum>9) sum=find(sum); //递归printf("%d\n",sum);}return 0;}
0 0
- 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
- HDU 1013Digital Roots
- HDU 1013 Digital Roots
- hdu 1013 Digital Roots
- hdu 1013 Digital Roots
- Digital Roots hdu 1013
- HDU 1013 Digital Roots
- hdu 1332 LC-Display
- PHP流式上传和表单上传(美图秀秀)
- 判断数组是否包含某元素
- HDU 2795-Billboard (单点更新,成段查询)
- css 样式
- hdu 1013 Digital Roots
- 程序员的奋斗史(四十六)——大学断代史(十)——给学弟学妹们的忠告——终结篇
- mysql日志详细解析
- poj1141
- 将pdf转换成excel的方法
- STM32之启动文件理解
- 查看进程调用的so动态库
- Pro Android学习笔记(一一一):2D动画(6):AnimationListener
- 基于S5PC100裸机程序之SPI(上)