GDUFE ACM-1005

Digital Roots

Time Limit: 2000/1000ms (Java/Others)

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(the length of each integer will not exceed 1000), 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:

24
39
0

Sample Output:

6
3思路挺简单的
附上AC代码：

#include<stdio.h>
#include<string.h>
int jys(int num)
{
    int sum=0;
    while(num>=10)
    {
        sum+=num%10;
        num/=10;
    }
        sum+=num;
        return sum;
}
int main()
{
    char s[1010];
    while(gets(s)&&s[0]!='0')
    {
        int i,x=0;
        for(i=0;i<strlen(s);i++)
        {
            x+=s[i]-'0';
        }
        while(x>=10)
        {
            x=jys(x);
        }
        printf("%d
",x);
    }
    return 0;
}

在网上发现了一种更简单的代码（九余数定理）：

#include<stdio.h>
int main()
{
    int s;
    char c;
    while(1)
    {
        s=0;
        while(scanf("%c",&c)&&c!='
')
            s+=c-'0';
        if(!s)return 0;
        else if(s%9==0)puts("9");
        else printf("%d
",s%9);
    }
    return 0;
}