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

    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

    原来这个题是大数问题,唉!提交了两次,WA了才发现这个问题

    #include<map>
    #include<set>
    #include<queue>
    #include<cmath>
    #include<vector>
    #include<cstdio>
    #include<string>
    #include<cstring>
    #include<cstdlib>
    #include<iostream>
    #include<algorithm>
    #define  inf 0x0f0f0f0f
    
    using namespace std;
    
    const double pi=acos(-1.0);
    const double eps=1e-8;
    typedef pair<int,int>pii;
    
    
    int main()
    {
        //freopen("in.txt","r",stdin);
    
        char str[10000];
        scanf("%s",str);
        while (!(strlen(str)==1 && str[0]=='0'))
        {
            int len=strlen(str);
            long long sum=0;
            for (int i=0;i<len;i++) sum+=str[i]-'0';
            while (sum/10)
            {
                long long n=sum;
                sum=0;
                while (n)
                {
                    sum+=n%10;
                    n=n/10;
                }
            }
            printf("%lld
    ",sum);
            scanf("%s",str);
        }
        //fclose(stdin);
        return 0;
    }
    至少做到我努力了
  • 相关阅读:
    Android 应用程序集成FaceBook 登录及二次封装
    Android MVP 设计模式
    java 接口的作用和好处
    Android版本和API Level对应关系
    Android 开源库和项目 2
    高效开发iOS系列 -- 那些不为人知的KVC
    HDU 1019 Least Common Multiple 数学题解
    程序猿喜欢如何的职位描写叙述?
    从零開始搭建微信硬件开发环境全过程——1小时掌握微信硬件开发流程
    Spring ORM数据訪问——Hibernate
  • 原文地址:https://www.cnblogs.com/chensunrise/p/3690322.html
Copyright © 2011-2022 走看看