zoukankan      html  css  js  c++  java
  • Hdu 1013 Digital Roots

    Digital Roots

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

    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

    #include<stdio.h>
    #include<string.h>int main()
    {
        while(1)
        {
            char c[1000];
            scanf("%s",c);
            if(strcmp(c,"0")==0)break;
            int i,sum=0;
            for(i=0;i<strlen(c);i++)
                sum+=c[i]-'0';
            while(sum>9)
                sum=sum/10+sum%10;
            printf("%d
    ",sum);
        }
        return 0;
    }     
    

      

  • 相关阅读:
    第一次热身赛和正式比赛感想
    简明解释算法中的大O符号
    poj 3045
    poj 3104
    poj 3273
    poj 3258
    poj 2456
    二分法小结
    Poj 2718 Smallest Difference
    GCJ——Crazy Rows (2009 Round 2 A)
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057787.html
Copyright © 2011-2022 走看看