Digital Roots
来源:互联网 发布:中国政法大学网络教育 编辑:程序博客网 时间:2024/05/02 00:22
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50769 Accepted Submission(s): 15841
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解题思路:注意输入大数的情况。。。
源代码:
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
while(cin>>str&&str!="0")
{
int num=0;
for(int i=0;i<str.length();i++)
{
num+=str[i]-'0';
if(num>9)
{
num=num/10+num%10;
}
}
cout<<num<<endl;
}
system("pause");
return 0;
}
0 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
- GDAL使用插件方式编译HDF4、HDF5以及NetCDF的bug修改
- C# 二维码生成和解析
- android binder c++层 - 回调客户端服务 - 客户端(c++层) 调用 服务端(c++层) 例子,服务端回调客户端服务
- Valgrind的使用方法
- [JAVA] java动态生成PDF文档
- Digital Roots
- 在js中动态创建表格
- Opencv图像数据类型
- Apple Watch人机交互指南:UI设计基础--动画、品牌化
- iOS防止键盘的遮挡
- Android资源文件简介
- 在eclipse中配置hadoop插件
- 在C#中主线程和子线程如何实现互相传递数据
- LeetCode——Search a 2D Matrix