Digital Roots

Digital Roots

Time Limit: 1000ms   Memory limit: 65536K  有疑問？點這裏^_^

題目描述

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.

輸入

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.

輸出

For each integer in the input, output its digital root on a separate line of the output.

示例輸入

24
39
0

示例輸出

6
3

坑了我半天，原來是道大水題，只有兩位數的數據，不存在大數什麼的，這就好辦多了，英語看不懂是真心會被坑啊！

#include<stdio.h>
#include<string.h>
int main()
{
    int i,n,sum;
    char s[22];
    while(scanf("%s",s)!=EOF)
    {
        if(s[0]=='0')
            break;
        sum=0;
        n=strlen(s);
        for(i=0; i<n; i++)
        {
            sum+=s[i]-'0';
            if(sum>9)
            {
                sum=sum%10+sum/10;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}