hdu1013Digital Roots

Digital Roots

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 88565    Accepted Submission(s): 27601

Problem Description

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，也等于各个为所有数之和模9（对9取余的余数）

注意；当这个数是9或是9的倍数时，它的数字跟就等于9！

代码：

#include<stdio.h>
int main()
{
	int s;
	char c;
	while(1)
	{
		s=0;
		while(scanf("%c",&c)&&c!='\n')
			s+=c-'0';
		if(!s)return 0;
		else if(s%9==0)puts("9");
		else printf("%d\n",s%9);
	}
	return 0;
}

注意不能输入数字直接取余，因为这个数可能太大用long long都存不下，所以将要处理的这个数每位都看作一个字符输入，然后减去‘0’，求和对9取余，这样就会好很多比如10的20次方是一个很大的的数。如果用字符来看的话它只有二十个字符