hdu1013注意用字符串！！

最新推荐文章于 2025-08-22 13:08:41 发布

原创最新推荐文章于 2025-08-22 13:08:41 发布 · 396 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#integer #input #output #each #list #file

字符串专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种计算数字根的方法，即通过不断累加整数的各位数字直至结果为单一位数的过程。并提供了一个示例程序，该程序可以接收一系列正整数作为输入，并输出每个整数对应的数字根。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Digital Roots

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

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 fan(int n)
{
    int sum=0;
    while(n!=0)
    {
        sum+=n%10;
        n=n/10;
    }
    if(sum<10)return sum;
    else return fan(sum);

}
int main()
{
    char ch[1009];
    int i,sum;
    while(gets(ch),ch[0]!='0')
    {
        sum=0;
        for(i=0;ch[i]!='\0';i++)
            sum+=ch[i]-'0';
        if(sum<10)printf("%d\n",sum);
        else
            printf("%d\n",fan(sum));
    }
    return 0;
}