寒假翻译题训练 2月5号

链接：https://acs.jxnu.edu.cn/problem/HDU1013

题目：

描述：

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.

翻译如下

描述：

一个正整数的数根是由这个整数所有位相加得来得。如果将这个整数的所有位相加得到的结果只有个位（即小于10），那么得到的结果就是这个整数的数根。如果该结果不仅仅只有个位（即大于10），则将得到的结果的所有位相加，重复之前的操作，直到得到的结果只有个位，该结果即为这个正整数的数根。

比如，给定一个正整数24，将2和4相加得到6，因为6只有个位，所以6为24的数根。给定一个正整数39，将3和9相加得到12，因为12不仅仅只有个位，则要重复之前的操作，将1和2相加得到3，因为3只有个位，所以3即为39的数根。
 

输入：

输入包含多组样例，每行包含一个正整数。当输入0时，终止输入。

输出：

对于每组样例，输出样例的数根。