杭电acm—1013 Digital Roots

Digital Roots

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 79867    Accepted Submission(s): 24974

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.

 

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

 

Recommend

We have carefully selected several similar problems for you:  1008 1021 1012 1004 1005 

这是一道水题，相信英语好的同学，一眼就懂，一个数各个位的和，要求要小于10，如果大于10继续拆分，不过要注意的是，这个数可能很大（陷阱一个），所以得要用字符串存储：

AC代码如下：

#include<stdio.h>#include<string.h>int root(int i){int x=0;while(i>0){x+=i%10;i=i/10;}return x;}int main(){    char str[1000];while(scanf("%s",str)!=EOF&&str[0]!='0'){int length=strlen(str);int add=0;for(int i=0;i<length;i++){if(str[i]>='0'&&str[i]<='9'){//第一个输入的可能为空格，加个条件为好add+=str[i]-'0';}}while(add>=10)add=root(add);printf("%d\n",add);}return 0;}