九度OJ题目1124:Digital Roots
来源:互联网 发布:公司域名怎么起 编辑:程序博客网 时间:2024/05/21 07:46
时间限制:1 秒
内存限制:32 兆
特殊判题:否
- 题目描述:
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 <stdio.h>#include <string.h> void digital_roots (char data[]){ int ans; int len; int i; len = strlen (data);//len表示输入整数的位数 ans = 0; for (i=0; i<len; ++i) ans += data[i] - '0';//各数位的数值相加 i = 0; while (ans){ //数位拆解 data[i] = ans % 10 + '0'; ans /= 10; ++i; } data[i] = '\0';//字符串结束符} int main(void){ char input[10001]; while (scanf ("%s", input) != EOF && input[0] != '0'){ //输入整数,输入0表示输入结束 while (strlen (input) > 1){ digital_roots (input); } printf ("%d\n", input[0] - '0');//输出结果 } return 0;}/************************************************************** Problem: 1124 User: zpy Language: C++ Result: Accepted Time:10 ms Memory:1020 kb ****************************************************************/
- 九度OJ 题目1124:Digital Roots
- 九度OJ题目1124:Digital Roots
- 题目1124:Digital Roots 九度OJ
- 【九度OJ】题目1124:Digital Roots 解题报告
- 九度oj-1124-Digital Roots
- 九度OJ-1124-Digital Roots
- 九度题目1124Digital Roots
- 【九度】题目1124:Digital Roots
- 九度 题目 1124:Digital Roots
- 九度题目1124:Digital Roots
- 九度OJ 1124 Digital Roots -- 数位拆解
- 题目1124:Digital Roots
- 题目1124:Digital Roots
- 题目1124:Digital Roots
- 题目1124:Digital Roots
- 九度OJ 1124:Digital Roots(数根) (递归)
- HDU OJ Digital Roots 题目1013
- 42-题目1124:Digital Roots
- Math.random()-实现浏览器验证码点击刷新的JS方法核心
- java数据割接:Sql server2005数据迁移至Sql server2008
- c++中scanf和printf
- java.lang.IllegalStateException: commit already called
- ArrayTools 去除List中重复的元素
- 九度OJ题目1124:Digital Roots
- sql server 2008附加不上数据库,报物理位置无法打开错误的解决方法
- VLC网页插件添加对火狐浏览器的支持
- 理解Hibernate中的query.setFirstResult(),query.setMaxResults(),取出任意n条数据
- mysql 中文乱码
- 3S技术
- windows下git修改打开bash时的默认路径
- Linux编程实践教程小结
- eclipse3.7安装flash builder 4.7插件