V - Digital Roots

本文介绍了一种计算数字根的方法,即通过不断累加整数的各个位直至得到一个一位数的过程。并提供了一个C++实现的例子,用于处理一系列正整数,输出每个整数对应的数字根。

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

题目如下

The digital root of a positive integer is found bysumming the digits of the integer. If the resulting value is a single digit thenthat digit is the digital root. If the resulting value contains two or moredigits, those digits are summed and the process is repeated. This is continuedas long as necessary to obtain a single digit. 

For example, consider the positive integer 24. Adding the 2 and the 4 yields avalue of 6. Since 6 is a single digit, 6 is the digital root of 24. Nowconsider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 isnot a single digit, the process must be repeated. Adding the 1 and the 2 yeilds3, 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 ofzero. 

--------------------------------------------------------------------------------------------------

 

输出如下:

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

--------------------------------------------------------------------------------------------------

 

测试用例输入如下:

24

39

0

--------------------------------------------------------------------------------------------------

 

测试用例输出如下:

6

3

--------------------------------------------------------------------------------------------------

结束条件搞错了,长度为1的,耽误了半天。注意点就是,sum的值,可能各位加起来还大于10哦,比如888888,---->48----->12------>3的。 

代码如下:

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int main()
{
	char a[10005];
	while(gets(a)!=NULL)
	{
		if(strlen(a)==1 && a[0]=='0') break;
	    int sum=0;
		for(int i=0;i<strlen(a);i++){
			sum+=a[i]-'0';
		}
		while(sum>=10)
		{
		    int sum1 = sum;
		    sum=0;
		    while(sum1>0)
			{
		       int t = sum1%10;
			   sum+=t;
			   sum1 = sum1/10;	
		    }
		}
		cout<<sum<<endl;
	}
	return 0;
}
--------------------------------------------------------------------------------------------------
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值