1519 Digital Roots
来源:互联网 发布:ssh登陆指定端口 编辑:程序博客网 时间:2024/04/30 20:14
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.
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
Sample Output
Source
Greater New York 2000
*************************************************************************
*************************************************************************
#include "stdio.h"#include "string.h"/*用字符串,去弥补整型过大问题,考虑整型过大时程序*/int main (){ long int i,k,n,sum; char a[10000]; for(;scanf("%s",a)!=EOF;) { if(a[0]=='0') return 1; sum=0; n=strlen(a); for(i=0;i<n;i++) sum+=a[i]-48; k=sum; if(k>9) for(sum=0;;) { for(;k!=0;) { sum+=k%10; k=k/10; } if(sum<10) break; else {k=sum;sum=0;} } printf("%d/n",sum); } return 1;}
63
24390
- POJ 1519 Digital Roots
- 1519 Digital Roots
- poj 1519 Digital Roots
- POJ 1519 Digital Roots
- poj 1519 Digital Roots
- POJ 1519 Digital Roots
- POJ 1519:Digital Roots
- POJ 1519 Digital Roots G++
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- QQ老大的作风!
- 微软研究院邹欣:笔试阅卷有感
- .net三层结构的简单理解
- 设置OpenGL编程环境
- 1597
- 1519 Digital Roots
- 1503 Integer Inquiry
- 1468 Rectangles
- 1432 Decoding Morse Sequences
- JBuilder中使用SQL server 2000时的配置步骤
- 1313 Booklet Printing
- 1251 Jungle Roads
- 浅谈数据库设计技巧(转经典)
- 1239 Increasing Sequences