杭电ACM 1013 Digital Roots - neuxxm's Blog - 本为贵公子，平生实爱才。感时思报国，拔剑起蒿莱。

杭电ACM 1013 Digital Roots

neuxxm posted @ 2011年5月19日 23:37 in 杭电ACM 解题报告 with tags Recur Recur_数字根 , 1874 阅读

Digital Roots

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

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

24
39
0

Sample Output

6
3

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

全局相关文章
相关文章

无匹配

无匹配