九余定理（hdu1013）

原创于 2018-04-13 11:24:11 发布 · 1.2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

个人知识点总结同时被 2 个专栏收录

55 篇文章

订阅专栏

数论

20 篇文章

订阅专栏

本文介绍了一个数的九余数概念及其计算方法，并通过一个具体的算法实例展示了如何求解正整数的数字根，即各位数字反复相加直至结果为一位数的过程。

九余数定理

一个数对九取余后的结果称为九余数。

一个数的各位数字之和想加后得到的<10的数字称为这个数的九余数（如果相加结果大于9，则继续各位相加）

Digital Roots

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

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

Source

Greater New York 2000

#include<stdio.h>  
#include<string.h>  
int main()  
{  
    char  num[1000];  
    int len,sum,i;  
    while(scanf("%s",&num)!=EOF)//这里为什么要字符串输入呢？原因是因为有一个测试数据很大，int类型肯定过不了，所以在这坑点我wa好几次
    {  
        len=strlen(num);  
        if(len==1 && num[0]=='0') return 0;  
        for(sum=0,i=0;i<len;i++)  
        {  
            sum=sum+num[i]-'0';  
        }  
        printf("%d\n",sum%9?sum%9:9);  
          
    }  
    return 0;  
}