HDOJ--Digital Roots

原创 2016年05月31日 20:20:19

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 <iostream>
#include <string>
using namespace std;


int main()
{
    string n;
    while (cin>>n)
    {
        if (n == "0")
            break;

        while (n.length() > 1)
        {
            int sum = 0;
            for (int i = 0; i < n.length(); ++i)
            {
                sum += n[i] - '0';
            }
            char buf[1000];
            sprintf(buf, "%d", sum);
            n = buf;
        }
        cout << n << endl;
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDOJ 1013 Digital Roots

Problem Description The digital root of a positive integer is found by summing the digits of the in...

HDOJ 1013题Digital Roots 大数,9余数定理

Problem Description The digital root of a positive integer is found by summing the digits of the int...

HDOJ 1013 Digital Roots

Digital Roots Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

hdoj 1163 Eddy's digital Roots

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1163 Problem Description The digital root of a positi...

HDOJ 1163 Eddy's digital Roots(简单数论)

【思路】:http://blog.csdn.net/iamskying/article/details/4738838 求解思路: 现在分析一个问题,假设将十位数为a,个位数为b的一个整数表示为ab,...

HDOJ 1013 Digital Roots(大数)

Digital Roots Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...

HDoj-1163- Digital Roots

Problem Description The digital root of a positive integer is found by summing the digits of the int...

HDU1013Digital Roots

Digital Roots Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

HDU 1013 Digital Roots 数字根 字符串处理基础题

题意:给你一个整数(骗你的),让你求它的数字根(经过处理后只剩下的个位数),如果不是个位数就要循环一个操作:把各个位的数加起来组合成一个新数,直到这个数是一个个位数(即题目所说的数字根)。 这题其实...

hdu1163 Eddy's digital Roots(数学:推导)

刚读这个题,感觉很厉害的样子 tuili
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)