zoukankan      html  css  js  c++  java
  • Digital Roots 杭电

    Digital Roots

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 343 Accepted Submission(s): 161
     
    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
    这道题最先,就SCANF("%D",N)结果WA 了,坑爹啊,后来看下网上代码才知道原来要输入个字符串

    #include<cstdio>
    #include<cstdlib>
    #include<cstring>
    #define M 1000
    char a[M+1];
    int main()
    {
     int t,i,temp,ans;
     char *p;
     while(scanf("%s",a)!=EOF)
     {
      p=a;
      if(strcmp(a,"0")==0) break;
      ans=0;
           while(*p)
        {
              temp=(*p)-'0';
        ans+=temp;
        while(ans/10)
         ans=ans/10+ans%10;
        p++;
        }
        printf("%d\n",ans);
        
        }
     return 0;
                
    }

        

  • 相关阅读:
    java映射
    java线程的一些方法和特性
    java线程通信
    java多线程同步
    java类对象概述
    JavaScript的对象——灵活与危险
    node.js项目中使用coffeescript的方式汇总
    12.2
    12.1
    11.30
  • 原文地址:https://www.cnblogs.com/woaiyy/p/2267829.html
Copyright © 2011-2022 走看看