九度OJ 1124 Digital Roots -- 数位拆解

最新推荐文章于 2022-11-13 22:39:04 发布

原创最新推荐文章于 2022-11-13 22:39:04 发布 · 1.3k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#九度OJ 考研机试

九度OJ 考研机试专栏收录该内容

90 篇文章

订阅专栏

本文介绍了一个计算数字根的算法，并提供了完整的C语言实现代码。数字根是指将一个正整数的所有位相加，如果结果大于9，则继续重复该过程直至得到一位数。文章通过实例解释了数字根的概念，并详细说明了算法的工作流程。

题目地址：http://ac.jobdu.com/problem.php?pid=1124

题目描述：

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

提示：

The integer may consist of a large number of digits.

#include <stdio.h>
#include <string.h>
 
void digital_roots (char data[]){
    int ans;
    int len;
    int i;
 
    len = strlen (data);
    ans = 0;
    for (i=0; i<len; ++i)
        ans += data[i] - '0';
    i = 0;
    while (ans){
        data[i] = ans % 10 + '0';
        ans /= 10;
        ++i;
    }
    data[i] = '\0';
}
 
int main(void){
    char input[10001];
 
    while (scanf ("%s", input) != EOF && input[0] != '0'){
        while (strlen (input) > 1){
            digital_roots (input);
        }
        printf ("%d\n", input[0] - '0');
    }
 
    return 0;
}