M - 枚举答案能不能做?
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
题意:求数字根
合九法:一个数字的根等于这个数模九,也等于各个位的数加起来模九。
由于数字有可能很大,所以采用字符输入,将其各位上的数加起来不断模9.
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n=0;
char a;
while(a=getchar())
{
if(a=='\n')
{
if(n)
{
if(n%9) printf("%d\n",n%9);
else printf("9\n");
n=0;
}
else return 0;
}
else if(a>='0'&&a<='9') n+=a-'0';
}
}