zoukankan      html  css  js  c++  java
  • Digital Roots

    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
     
     
     1 #include<stdio.h>
     2 #include<string.h>
     3 int fun(int n)
     4 {
     5  int sum=0;
     6     do
     7     {
     8        sum=0;
     9        while(n>0)
    10        {
    11          sum+=n%10;
    12          n/=10;
    13        }
    14        n=sum;
    15     }
    16     while(n>=10);
    17     return sum;
    18 }
    19 int main()
    20 {
    21     int sum,i,len;
    22     char s[1100];
    23     while(scanf("%s",s))
    24     {
    25         if(strcmp(s,"0")==0)
    26             break;
    27         else
    28            len=strlen(s);
    29            sum=0;
    30            for(i=0;i<len;i++)
    31             sum+=s[i]-'0';
    32            while(sum>=10)
    33             {
    34              sum=fun(sum);
    35             }
    36              printf("%d
    ",sum);
    37     }
    38     return 0;
    39 }
  • 相关阅读:
    机器学习(04)——常用专业术语
    C# 线程同步的三类情景
    线程同步的情景之三
    线程同步的情景之二
    线程同步的情景之一
    Thread.Sleep(0) vs Sleep(1) vs Yeild
    Visual Studio 实用扩展推荐
    为革命保护视力 --- 给 Visual Studio 换颜色
    免费的精品: Productivity Power Tools 动画演示
    如何扩展 Visual Studio 编辑器
  • 原文地址:https://www.cnblogs.com/wangmengmeng/p/4552484.html
Copyright © 2011-2022 走看看