1784:Digital Roots

本文主要是介绍1784: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.

输入格式

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;
}

 

这篇关于1784:Digital Roots的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---