HDU 1013 :Digital Roots。
来源:互联网 发布:数据库三范式原子 编辑:程序博客网 时间:2024/06/05 19:39
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>int main(){ int i,m; char s[1000]; while(scanf("%s",s)==1&&s[0]!='0') { for(m=i=0;s[i];i++) m+=s[i]-'0'; printf("%d\n",m%9==0? 9:m%9 ); } 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 4775 Infinite Go
- oracle基本概念学习笔记
- [USACO Training] Broken Necklace (DP)
- 51-输出4位加密整数结果
- 错误:error: expected class-name before '{' token解决方法
- HDU 1013 :Digital Roots。
- apache建立虚拟目录
- OpenStack中的安全组织
- CPU架构学习笔记之 Nehalem
- 东北爷们就是猛啊——冬季“裸泳部落”聚集在松花江
- 4187. 合法三角形 easy one
- OpenStack社区周报第六期(12.26-01.16)
- C#学习之流控制
- 一张图讲清楚高可用、高性能、可扩展的WEB系统架构