杭电1163--Eddy's digital Roots (九余数定理)
来源:互联网 发布:mac伴奏降调 编辑:程序博客网 时间:2024/04/30 12:26
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.
The Eddy's easy problem is that : give you the n,want you to find the n^n's digital Roots.
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 Eddy's easy problem is that : give you the n,want you to find the n^n's digital Roots.
Input
The input file will contain a list of positive integers n, one per line. The end of the input will be indicated by an integer value of zero. Notice:For each integer in the input n(n<10000).
Output
Output n^n's digital root on a separate line of the output.
Sample Input
2 4 0
Sample Output
4 4
一个数对九取余,得到的数称之为九余数;
一个数的九余数等于它的各个数位上的数之和的九余数!
# include<stdio.h>
int main()
{
}
- 杭电1163--Eddy's digital Roots (九余数定理)
- Hdu-1163 Eddy's digital Roots(九余数定理)
- Eddy's digital Roots 1163 (数学+九余数定理)
- Hdu 1163 Eddy's digital Roots(九余数定理)
- HDU 1163 Eddy's digital Roots(九余数定理)
- hdu 1163 Eddy's digital Roots(九余数定理)
- HDU 1163 Eddy's digital Roots(九余数定理)
- hdoj-1163-Eddy's digital Roots【九余数定理】
- [数学 九余数定理] HDU 1163 Eddy's digital Roots
- [ACM - 数论]Eddy's digital Roots(九余数定理)
- HDU——1163Eddy's digital Roots(九余数定理+同余定理)
- HDU——1163Eddy's digital Roots(九余数定理+同余定理)
- hdu 1163 Eddy's digital Roots(九余数定理,快速幂)
- Hdu 1163 Eddy's digital Roots + NYOJ-485 A*B Problem(九余数定理)
- HDU-#1163 Eddy's digital Roots(九余数定理+同余)
- HDOJ 1163 Eddy's digital Roots(九余数定理的应用)
- HDU 1163 Eddy's digital Roots 【九余数定理 Or 规律(瞎搞)】
- 九余数定理——hdu_1163 Eddy's digital Roots
- ADT版本号超过17后,所遇到的问题,如导入项目没有Android Dependencies目录、jars包导入的解决办法
- 命令行运行hadoop的HelloWorld,word count - 总结
- tomcat 6/7 maven 自动发布+热部署方法
- HDU 1106 排序
- CSS的一些常识
- 杭电1163--Eddy's digital Roots (九余数定理)
- Call JavaScript from server side
- Android SDK Tools 无PAI更新处理办法!
- 进程间通信方式介绍-管道
- 不显示dashboard空间
- java换行输出数据,一行输出5个,此例子适用于图片展示,一行显示n个图片
- VC 打开目录对话框
- Linux笔记
- Mysql 主从备份error 1062 处理方法