南邮 OJ 1028 Digital Roots
来源:互联网 发布:汉口北淘宝商学院 编辑:程序博客网 时间:2024/06/08 08:34
Digital Roots
时间限制(普通/Java) : 1000 MS/ 3000 MS 运行内存限制 : 65536 KByte
总提交 : 649 测试通过 : 240
总提交 : 649 测试通过 : 240
比赛描述
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
题目来源
Greater New York 2000
#include <iostream>#include <string>using namespace std;unsigned int digitalRoot(string str){int a[1024]={0};int i=0,n=0,num=0;i = 0;while(str[i]){a[i++] = str[i]-'0';}n = i;num = 0;for(i=0;i<n;++i){num += a[i];}while(num/10!=0){i = 0;while(num){a[i++] = num%10;num /= 10;}n = i;num = 0;for(i=0;i<n;++i){num += a[i];}}return num;} int main(void){string str;while(cin>>str && str!="0"){cout<<digitalRoot(str)<<endl;}}
0 0
- 南邮 OJ 1028 Digital Roots
- hdu-oj 1013 Digital Roots
- hdu-oj 1013 Digital Roots
- Hdu oj 1013 Digital Roots
- 杭电OJ--1013 Digital Roots
- hdu-oj 1163 Eddy's digital Roots
- HDU OJ Digital Roots 题目1013
- 九度OJ 题目1124:Digital Roots
- 九度oj-1124-Digital Roots
- 杭电oj Problem-1013 Digital Roots
- hdu oj 1013 Digital Roots 解题报告
- hdu oj 1013 Digital Roots(dfs)
- 九度OJ-1124-Digital Roots
- 九度OJ题目1124:Digital Roots
- 题目1124:Digital Roots 九度OJ
- Digital Roots
- Digital Roots
- Digital Roots
- openstack keypair实践
- 南邮 OJ 1027 Quicksum
- 一些设计上的基本常识
- 排序
- Centos6.5 x86_64下 静默安装Oracle 11g R2
- 南邮 OJ 1028 Digital Roots
- 微服务实战
- word 转html,pdf转图片
- NGUI界面Drawcall优化
- 8. Document getElementById() 方法
- Sizeof与Strlen的区别与联系
- 程序员技术练级攻略
- ubuntu修改主机名
- 文件加解密(二)——使用密码