HDOJ 1014Digital Roots

Digital Roots

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

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
这道题的坑在于没有告诉数有多少位，所以数可能非常大，这样就用字符串这个储存数，这样算完第一次后，数的位数会小很多，得到一个整数sum(不是字符串)，如果sum大于
10，就再把sum的每一位加起来，直到sum小于10
代码：

   
   
#include<cstdio>
#include<cstring>

using namespace std;

char s[1000000];

int f(int a){
	int sum=0;
	while(a!=0){
		sum+=a%10;
		a/=10;
	}
	return sum;
}

int main(){
	
	while(scanf("%s",s)!=EOF&&s[0]!='0'){
		int len=strlen(s),sum=0;
		for(int i=0;i<len;i++){//没有告诉数有多大可能有100+位 
			sum+=s[i]-'0';
		}
		if(sum<10){
			printf("%d\n",sum);
		}
		else{
			for(;;){
				if(sum<10){
					printf("%d\n",sum);
					break;
				}
				sum=f(sum);
			}
		}
	}
	return 0;
}