hdu1013 (Digital Roots）

---

hdu1013 (Digital Roots）

---

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1013
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

理解：计算输入数字每位数的和，比如39，个位和十位数的和位12，大于10，再对12求和，小于10，得到答案3。可以用取余的方法，把数字存在数组里，把数组的每个元素相加。数字容量最好要大，当容量为1000是wrong，但是设置到10000就可以了。

//
//  main.cpp
//  hdu1013
//
//  Created by zhan_even on 2018/10/19.
//  Copyright © 2018年 zhan_even. All rights reserved.
//

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {
    char number[10000];
    int i,sum;
    while (~scanf("%s",number)&&number[0]!='0') {
        sum = 0;
        for(i=0; i<strlen(number); i++){
            sum = number[i] + sum - '0';
        }
        while(sum>9)
            sum = sum % 10 + sum/10;
        cout<<sum<<endl;
    }
    return 0;
}

还有另一种方法，利用公式 余9法
d(n)=1+(n−1) mod 9

//
//  main.cpp
//  hdu1013
//
//  Created by zhan_even on 2018/10/19.
//  Copyright © 2018年 zhan_even. All rights reserved.
//

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {
    char number[10000];
    int i,sum;
    while (~scanf("%s",number)&&number[0]!='0') {
        sum = 0;
        for(i=0; i<strlen(number); i++){
            sum = number[i] + sum - '0';
        }
        cout<<1+(sum-1)%9<<endl;
    }

    return 0;
}