关闭

九度oj-1124-Digital Roots

标签: 九度
346人阅读 评论(0) 收藏 举报
分类:

时间限制: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;
}

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:235664次
    • 积分:8101
    • 等级:
    • 排名:第2628名
    • 原创:596篇
    • 转载:55篇
    • 译文:0篇
    • 评论:5条
    最新评论