[Problem]-avionics OJ1013 Digital Roots, oj1013roots

[Problem]-avionics OJ1013 Digital Roots, oj1013roots

Problem Description The digital root of a positive integer is found
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
Digital root of 39.

Input The input file will contain in a list of positive integers, one per
Line. The end of the input will be indicated by an integer value
Zero.

Output For each integer in the input, output its digital root on
Separate line of the output.

Sample Input

24 39 0

Sample Output

6 3

This topic examines the theorem of 9 remainder numbers.

#include <stdio.h>#include <string.h>char n[10001];int add_digital(const char* str){    int result = 0;    char* pointer = (char*)str;    while(*pointer){        result += *pointer - 48;        pointer++;    }    return result;}int main(){    while(scanf("%s",n)){        if(!strcmp(n,"0")) break;        int sum = add_digital(n);        printf("%d\n",(sum - 1)%9 + 1);    }    return 0;}