HDU1013 Digital Roots

                                                      Digital Roots

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

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
   
   
   
   

 

Source

Greater New York 2000

解题思路：本题无逻辑难点，只是，注意数据量，我就一直WA直到百度到一个数组开到1000的代码，才恍然大悟。经过试验测试，本题的整数数据超过500位，所以，10位的整型数据或10个字符型的数组是肯定会WA的。

#include<stdio.h> #include<string.h> int main() {     __int64 n;     char a[1000];     while(scanf("%s",a)&&a[0]!='0')     {         int str=strlen(a);         while(str!=1)    //只有1位数         {             n=0;             for(int i=0;i<str;i++)                 n+=a[i]-'0';             sprintf(a,"%d",n);             str=strlen(a);         }         printf("%d\n",a[0]-'0');     }     return 0; }