九度oj-1124-Digital Roots

原创 2015年11月18日 21:56:38

时间限制:1 秒

内存限制:32 兆

特殊判题:

提交:2969

解决:1069

题目描述:

    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.

输入:

    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.

输出:

    For each integer in the input, output its digital root on a separate line of the output.

样例输入:
24
39
0
样例输出:
6
3
提示:

The integer may consist of a large number of digits.

来源:
2008年北京大学方正实验室计算机研究生机试真题


#include<iostream>
#include<cstring>
using namespace std;
int main()
{
    char a[100000];
    while(cin>>a)
    {
        if(strcmp(a,"0")==0) break;
        int n=0,s,i;
        for(i=0;a[i]!='\0';i++)
            n+=a[i]-'0';
        s=n;
        while(n>9)
        {
            s=0;
            while(n)
            {
                s+=n%10;
                n/=10;
            }
            n=s;
        }
        cout<<n<<endl;
    }
    return 0;
}

zzuli OJ 1124: 两个有序数组合并

Description 已知数组a中有m个按升序排列的元素,数组b中有n个按降序排列的元素,编程将a与b中的所有元素按降序存入数组c中。 Input 输入有两行,第一行首先是一个正整...

OJ_1124

#include using namespace std; const int N=101; int ctoi(char c) { return c-'0'; } int getresul...

九度OJ-1124-Digital Roots

此题的关键在于:题目提示The integer may consist of a large number of digits.,故要考虑到输入数字会产生溢出。所以对初始输入要采取字符串的形式加以记录...

杭电OJ--1013 Digital Roots

Digital Roots                                                            Time Limit: 2000/1000 MS...

hdu oj 1013 Digital Roots 解题报告

题目描述:          The digital root of a positive integer is found by summing thedigits of the integer. ...

九度OJ八皇后问题

  • 2013年04月09日 23:47
  • 3KB
  • 下载

hdu 1013 Digital Roots【数根计算 余九解法】

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

hdu 1163 Eddy's digital Roots (数根)

Eddy's digital Roots Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Oth...

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...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:九度oj-1124-Digital Roots
举报原因:
原因补充:

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