【九度】题目1124：Digital Roots

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：3927

解决：1382

题目描述：

    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.

样例输入：

24390

样例输出：

63

提示：

The integer may consist of a large number of digits.

题意为：对一个数字分解，每位相加。若小于10，则为所求；若大于10，进行迭代直至小于10。

// Digital Roots.cpp : 1、对一个数字分解的方法：先%10再/10，循环的条件为不为0；//                     2、迭代的思想，将迭代的过程单独拿出来作为一个函数比较好处理。#include "stdafx.h"#include <string.h>int getdigit(int x){int m=0;while (x){m+=x%10; x/=10;}return m;}int _tmain(int argc, _TCHAR* argv[]){int n;while (scanf("%d",&n)){int sum=n;while (sum>9){sum=getdigit(sum);}printf("%d",sum);}return 0;}