[暖手][学习阶段-各路杂题][HDU-1163]Eddy's digital Roots
来源:互联网 发布:python量化论坛 编辑:程序博客网 时间:2024/06/05 17:49
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
240
Sample Output
44
import java.util.Arrays;import java.util.Scanner;public class Main { public static void main(String args[]) { Scanner in = new Scanner(System.in); int n = in.nextInt(); while(n!=0){ int temp = n; for(int i=2;i<=n;i++) temp = temp*n%9; if(temp==0) System.out.println("9"); else System.out.println(temp); n = in.nextInt(); } } }
0 0
- [暖手][学习阶段-各路杂题][HDU-1163]Eddy's digital Roots
- [暖手][学习阶段-各路杂题][HDU-1164]Eddy's research I
- hdu 1163 Eddy's digital Roots
- hdu 1163 Eddy's digital Roots
- HDU 1163 Eddy's digital Roots
- HDU 1163 Eddy's digital Roots
- HDU 1163 Eddy's digital Roots
- 数论---HDU 1163 Eddy's digital Roots
- HDU 1163 Eddy's digital Roots
- hdu 1163 Eddy's digital Roots
- HDU 1163 Eddy's digital Roots
- hdu(1163)Eddy's digital Roots
- HDU 1163 Eddy's digital Roots(数论)
- hdu 1163 Eddy's digital Roots
- hdu 1163 Eddy's digital Roots (数论)
- hdu-1163-Eddy's digital Roots
- HDU 1163 Eddy's digital Roots
- hdu-oj 1163 Eddy's digital Roots
- NTU-Coursera机器学习:多類別分类和非线性转换
- c++ 模板的一些
- LeetCode:Remove Duplicates from Sorted Array II
- OpenGL基础图形编程
- eclipse导出jar文件再将它转换成exe可执行文件详解
- [暖手][学习阶段-各路杂题][HDU-1163]Eddy's digital Roots
- hdu-5167 Fibonacci
- Assetbundle创建与加载
- UBUNTU13 + Skyeye1.3.5
- Event-driven programming for Android
- win10下wamp环境搭建(包括整套软件、安装DOC讲解、数据库清理等)
- JPDA#1:使用JDI写一个调试器
- PSAM卡相关知识整理
- What is Reactive Programming?