Digital Roots
来源:互联网 发布:淘宝网人家卖不侵权 编辑:程序博客网 时间:2024/05/02 01:38
Problem Description
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.
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.
Input
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.
Output
For each integer in the input, output its digital root on a separate line of the output.
Sample Input
24390
Sample Output
63
Source
Greater New York 2000
注意:这个题目输入的整合位数可能会很大
答案:
#include <stdio.h>
#include <string>
char n[1000000];
int len;
int r;
int len;
int r;
void solve()
{
len = strlen(n);
if (len == 1)
r = n[0] - '0';
else
{
int sum = 0;
for (int i = 0; i < len; ++i)
sum += (n[i]-'0');
{
len = strlen(n);
if (len == 1)
r = n[0] - '0';
else
{
int sum = 0;
for (int i = 0; i < len; ++i)
sum += (n[i]-'0');
itoa(sum, n, 10);
solve();
}
}
solve();
}
}
int main()
{
while (scanf("%s", n)!=EOF)
{
len = strlen(n);
if (len == 1 && n[0] == '0')
break;
solve();
printf("%d/n", r);
}
return 0;
}
{
while (scanf("%s", n)!=EOF)
{
len = strlen(n);
if (len == 1 && n[0] == '0')
break;
solve();
printf("%d/n", r);
}
return 0;
}
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- A Mathematical Curiosity
- 菜鸟十天学会ASP教程之第二天:表单传送变量
- 优化Direct3D中多流(Multistreaming)的资源分配
- 软件开发外包
- SSH 隧道的建立
- Digital Roots
- 获取Active Directory里user的明细
- Latex第一篇
- 呆了这么久终于要复出了
- 模板类中操作符重载问题(">"重载)
- asp 程序代码技巧:函数
- 搞好网络关系
- Java常见异常处理陋习
- SWT多线程-关于非UI线程操作UI线程(一)