题目来源 牛客网
Digital Roots
题目描述
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.D
输入
The input file will contain a list of positive integers, one per line.
The integer may consist of a large number of digits.
输出
The input file will contain a list of positive integers, one per line.
The integer may consist of a large number of digits.
简单描述题意:
输入多行数字,如果这个数是单个的数字的话,则输出。否则将改数的各个位加起来,成为新的一个数,再重复判断是否为单个数…
不涉及数据结构与算法,属于基础题,巩固基础。
参考代码C++
#include<iostream>
using namespace std;
int fun(int n){
int sum=0;
while(n!=0){
sum+=n%10;
n/=10;
}
return sum;
}
int main(void){
int n;
while(cin>>n){
while(n/10!=0)
n=fun(n);
cout<<n<<endl;
}
}