*寒假水101——枚举答案能不能做？

最新推荐文章于 2025-01-26 20:47:26 发布

原创最新推荐文章于 2025-01-26 20:47:26 发布 · 179 阅读

0 ·

CC 4.0 BY-SA版权

2017寒假专栏收录该内容

123 篇文章

订阅专栏

本文介绍了一种计算数字根的方法，通过将正整数的各位数字相加直至得到一位数的过程进行阐述，并提供了一段C++代码实现。该算法适用于求任意长度正整数的数字根。

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.

InputThe 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.
OutputFor 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

#include<iostream>
#include<stdio.h>  
#include<string.h>

using namespace std;
  
int main()  {  
    int i,n,t,ans;  
    char a[10000];  
    while(gets(a)){  
        if(strcmp(a,"0")==0){
            break;	
        }  
        n=strlen(a);  
        ans=0;  
        for(i=0;i<=n-1;i++){  
            ans+=a[i]-'0';  
        }  
        while(ans>=10){  
            t=ans;  
            ans=0;  
            while(t){  
                ans+=t%10;  
                t=t/10;  
            }  
        }  
        cout<<ans<<endl;  
    }  
    return 0;  
}

题解：数字根的题做过，不难。。。。。。而这道题明确的说，枚举WA。吓得宝宝哇的一声哭出来了。

没错，怎么定义这个数都有问题。哼！哼！哼！

把它定义成字符串，我就不信它装不下。