1784:Digital Roots

原创 2013年12月05日 21:20:05

题目描述

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

#include<stdio.h>
int fan(int num)
{
  int d=num;
  while(d>=10)
  { 
    d=0;
    while(num)
    {
      d+=num%10;
        num=num/10;
    }
    num=d;
  }
  return d;
}   
int main()
{
  char str[1000];
  int n,i;
  while(scanf("%s",str)!=EOF && str[0]!='0')
  {
    n=i=0;
    while(str[i])
    {
      n+=str[i]-'0';
      i++;
    }
    printf("%d\n",fan(n));
  }
  return 0;
}
  


 

相关文章推荐

hdu oj 1013 Digital Roots 解题报告

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

HDU 1013 Digital Roots(数论)

题意:所谓的“根”就是将每位数字相加得到的数字(直到和小于10)。就是让我们将数字的每位数字相加,然后看所得新数字是不是“根”,若不是,再相加。 此题可以简单AC,亦可以练习数论 一般思路:因为题目...

HDU--1013--Digital Roots

Description The digital rootof a positive integer is found by summing the digits of the integer. If ...

hdu 1013 Digital Roots(简单题)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1013 Digital Roots Time Limit: 2000/1000 MS (Ja...

hdu1013 Digital Roots

热烈庆祝本人于2013.1.22正式开张,路过的都顶啊!     本题是hdu1013   Digital Roots  .原题地址http://acm.hdu.edu.cn/showproblem....

hdoj 1163 Eddy's digital Roots

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

hdu 1163 Eddy’s digital Roots

Eddy’s digital Roots 问题描述 : The digital root of a positive integer is found by summing t...

HDU 1163 Eddy's digital Roots(九余数定理+快速幂)

九余数法,也叫弃九法,可以用来求一个数的弃九数,也能叫“根数”(即求这个数所有位的数的和,如果不是10以内的数,就重复这个过程,直到变成10以内的数,比如128的结果就是2,首先把128中的1,2,8...

HDU yt13双周赛1001 Digital Roots

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

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

题意:给你一个整数(骗你的),让你求它的数字根(经过处理后只剩下的个位数),如果不是个位数就要循环一个操作:把各个位的数加起来组合成一个新数,直到这个数是一个个位数(即题目所说的数字根)。 这题其实...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1784:Digital Roots
举报原因:
原因补充:

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