HDOJ 1163 Eddy's digital Roots(九余数定理的应用)
2016-04-01 16:57
330 查看
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.
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
题意:输入一个数n,求n的n次方的数根。
数根:即某数字的每一位上的数字之和,如果和大于等于10,重复每一位上的数字之和,直到每一位上的数字之和是个位数。则这个个位数就是这个数字的数根。
九余数定理:
一个数对九取余,得到的数称之为九余数;
一个数的九余数 等于 它的各个数位上的数之和的九余数!
例:
5^5=3125
3+1+2+5=11
1+1=2(digital Roots)
3125%9=2;
一个数对9取余就等于它的个位数字之和对9取余就等于数根对9取余。
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.
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
题意:输入一个数n,求n的n次方的数根。
数根:即某数字的每一位上的数字之和,如果和大于等于10,重复每一位上的数字之和,直到每一位上的数字之和是个位数。则这个个位数就是这个数字的数根。
九余数定理:
一个数对九取余,得到的数称之为九余数;
一个数的九余数 等于 它的各个数位上的数之和的九余数!
例:
5^5=3125
3+1+2+5=11
1+1=2(digital Roots)
3125%9=2;
一个数对9取余就等于它的个位数字之和对9取余就等于数根对9取余。
import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner sc= new Scanner(System.in); while(sc.hasNext()){ int n = sc.nextInt(); if(n==0){ return ; } int m = 1; for(int i=0;i<n;i++){ m=(m*n)%9; } if(m==0){ System.out.println(9); }else{ System.out.println(m); } } } }
相关文章推荐
- Android ui 透明度设置
- SignalR主动通知订阅者示例
- 论文中怎样加入参考文献
- 类的成员函数:几个重载函数
- hdu-2888 Check Corners(二维RMQ模板题)
- linux下安装JDK
- redis sentinel配置
- 设置SVN提交时强制添加注释
- Auto Layout界面自动布局系列1-自动布局的基本原理
- hdu4228 (反素数)
- Delphi “Invalid floating point operation.”错误的解决方法(使用System单元提供的Set8087CW函数禁用浮点异常)
- HttpWebRequest用法实例
- 记一次 nginx 504 Gateway Time-out
- 程序员的自我修养:有助于提高沟通能力的7本书
- 六大刹车技巧,帮你避免90%的事故
- Android USB通信
- 批量保存图片到指定文件夹中
- 62. Unique Paths
- 总结一下Intent匹配机制
- 杭电ACM1012