zoukankan      html  css  js  c++  java
  • HDU Digital Roots

    Digital Roots

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 176 Accepted Submission(s): 91
    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
     
     
    #include <iostream>
    #include <string.h>
    using namespace std;
    int num;
    int di(int a)
    {
        num =0;
        while(a>9)
        {
            num+=a%10;
      a = a/10;
        }
     num +=a;
        return num;
    }
    int main()
    {
        int t;
        string n;
        while(cin>>n&&(n[0]-'0'))
        {
            t = 0;
            for(int i = 0 ; i < n.length() ; i++)
            {
                t += n[i]-'0';
            }
            if(t<10)cout<<t<<endl;
            else
            {
                t = di(t);
                while(t>9)t = di(t);
                cout<<t<<endl;
            }
        }
        return 0;
    }
  • 相关阅读:
    SQL select结果集和return的区别
    转发:上海软件公司排行 (估计是2008年的吧)
    还未复习的
    转发:IT行业中的甲方乙方关系
    多线程 异步调用委托
    用sessionStorage实现页面之间的数据传输
    【转】Vue.js:轻量高效的前端组件化方案
    几种web数据渲染模板对比
    ThinkPHP执行原生sql,实现一些复杂的业务需求
    listview可见再加载图片
  • 原文地址:https://www.cnblogs.com/newpanderking/p/2117679.html
Copyright © 2011-2022 走看看