九度1124：digital root

最新推荐文章于 2019-02-27 15:31:25 发布

cjf1699

最新推荐文章于 2019-02-27 15:31:25 发布

阅读量320

点赞数

分类专栏：数学运算文章标签：九度保研机试数学运算

本文链接：https://blog.csdn.net/cjf1699/article/details/77233228

版权

数学运算专栏收录该内容

12 篇文章 0 订阅

订阅专栏

题目1124：Digital Roots

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：5513

解决：1852

题目描述：

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.

来源：

2008年北京大学treble

方正实验室计算机研究生机试真题

*************************************

一遍AC的题

这道题就是不断地分割，相加，判断........但有一个点需要注意，重新拆分sum时，结尾别忘了添上‘\0’，使字符串结尾，否则可能因为buf里存的是上次的数据（位数更多）导致出错。

#include <cstdio>
#include <cstring>
using namespace std;
char buf[100]={0};
void chai(int n)
{
    int i=0;
    while(n!=0){
        buf[i++]=n%10+'0';
        n/=10;
    }
    buf[i]='\0';
}
int main()
{
    while(scanf("%s",buf)!=EOF){
        int len=strlen(buf),sum=0;
        if(buf[0]=='0'&&len==1)   return 0;
        while(1){
            for(int i=0;i<len;i++)
                sum+=(buf[i]-'0');
            if(sum>=0&&sum<=9){
                printf("%d\n",sum);
                break;
            }
            chai(sum);
            len=strlen(buf);sum=0;
        }
    }
    return 0;
}