zoukankan      html  css  js  c++  java
  • HDU 1013 Digital Roots 题解

    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 <stdio.h>
    #include <string>
    #include <iostream>
    using std::cin;
    using std::string;
    
    int getRootDigit(int num)
    {
    	int root = num;
    	while (root > 9)
    	{
    		root = 0;
    		while (num)
    		{
    			root += num % 10;
    			num /= 10;
    		}
    		num = root;
    	}
    	return root;
    }
    
    int main()
    {
    	string s;
    	while (cin>>s)
    	{
    		if (s == "0") break;
    		int num = 0;
    		for (int i = 0; i < (int)s.size(); i++)
    		{
    			num += s[i] - '0';
    		}
    		printf("%d
    ", getRootDigit(num));
    	}
    	return 0;
    }



  • 相关阅读:
    LVS的优点和缺点
    linux系统中如何查看日志 (常用命令)
    linux隐藏病毒处理(top查询us占用70%左右,却没有CPU高使用的进程)
    linux系统批量注释的方法
    linux系统硬件时间命令
    LINUX服务器设置只允许密钥登陆
    linux系统脚本放在后台与前台
    Kworkerd恶意挖矿分析
    HAProxy的优点
    find命令
  • 原文地址:https://www.cnblogs.com/yjbjingcha/p/7019946.html
Copyright © 2011-2022 走看看