牛客网KY72-digitalroots-优快云博客

本文链接：https://blog.youkuaiyun.com/weixin_43909219/article/details/108112177

本文介绍了一种计算数字根的方法，通过不断累加整数的各位数字直至结果为单个数字。提供了C++代码示例，展示了如何读取一系列正整数并输出各自的数字根。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述

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 integer may consist of a large number of digits.
输出描述:

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

输入

24
39
0

输出

6
3

代码

#include<iostream>
using namespace std;

int fn(int x){
    int y=0;
    while(x){
        y+=x%10;
        x/=10;
    }
    int z=y;
    if(z<10)
        return z;
    else if(z>=10)
        return fn(z);
}
int main(){
    int n,m=0;
    while(cin>>n){
        if(n<10){
            cout<<n<<endl;
        }else{
            cout<<fn(n)<<endl;
        }
    }
    return 0;
}