# 九度oj-1124-Digital Roots

299人阅读 评论(0)

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

The integer may consist of a large number of digits.

2008年北京大学方正实验室计算机研究生机试真题

#include<iostream>
#include<cstring>
using namespace std;
int main()
{
char a[100000];
while(cin>>a)
{
if(strcmp(a,"0")==0) break;
int n=0,s,i;
for(i=0;a[i]!='\0';i++)
n+=a[i]-'0';
s=n;
while(n>9)
{
s=0;
while(n)
{
s+=n%10;
n/=10;
}
n=s;
}
cout<<n<<endl;
}
return 0;
}


0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：216975次
• 积分：7915
• 等级：
• 排名：第2588名
• 原创：596篇
• 转载：55篇
• 译文：0篇
• 评论：5条
评论排行
最新评论