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

这题好像做过类似的，但是是简单版，本想这直接开个字符数组输入用循环慢慢的做，但是不行。百度后有个方法：合九法,一个数字的根等于这个数模九，也等于各个位的数加起来模九，第一个方法显然不可能，因为数可能很大，longlong都表示不了的就不能做了，第二个方法，直接开个字符串数组for加得总数模9；后来发现了个神级代码while（a=getchar）输入字符，不用开数组。//中间遇到一点麻烦，合九法的理解，我以为是直接吗，模九输出。提交后wa了，后来想想，模9会把9忽略掉，所以当模九等于0时输出9。

 #include<iostream>
#include<string>
#include<cstdio> 
using namespace std;
int main()
{
 int sum=0;
 char a;
 while(a=getchar())//输入 
 {
  if(a=='\n')//输入为回车时输出 
  {
   if(sum!=0)//sum不等于0时就输出，等于0说明输入为0 
   {
   cout<<(sum%9?sum%9:9)<<endl;
   sum=0; 
   }
   else
   {
    return 0; //和break作用一样。 
   }
  }
  else if(a>='0'&&a<='9')
  {
   sum+=a-'0'; 
  }
 }
 return 0;
}