九度oj-1124-Digital Roots
来源:互联网 发布:mac关闭快捷键 编辑:程序博客网 时间:2024/06/14 00:37
- 题目描述:
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.
- 样例输入:
24390
- 样例输出:
63
- 提示:
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;}
- 九度OJ 题目1124:Digital Roots
- 九度oj-1124-Digital Roots
- 九度OJ-1124-Digital Roots
- 九度OJ题目1124:Digital Roots
- 题目1124:Digital Roots 九度OJ
- 九度OJ 1124 Digital Roots -- 数位拆解
- 【九度OJ】题目1124:Digital Roots 解题报告
- 九度题目1124Digital Roots
- 【九度】题目1124:Digital Roots
- 九度 题目 1124:Digital Roots
- 九度题目1124:Digital Roots
- 九度OJ 1124:Digital Roots(数根) (递归)
- Hdu oj 1013 Digital Roots(九余数定理)
- 九度oj 1124 Digital Root
- hdu-oj 1013 Digital Roots
- hdu-oj 1013 Digital Roots
- 南邮 OJ 1028 Digital Roots
- Hdu oj 1013 Digital Roots
- Java基础(15):集合
- linux /centos 中OpenSSL升级方法详解
- Java中线程的通信
- Julia: Dict类型 与 Symbol
- 文本文件读取截取以及存储
- 九度oj-1124-Digital Roots
- final修饰符---final方法
- 分享一个网页代码
- 关于字符编码延伸出来的
- 计算机科学不等于数学
- LightOJ 题目1027 - A Dangerous Maze(期望)
- volatile
- NYOJ 49 开心的小明 【0 1 背包】
- 9本Java程序员必读的书