NYOJ 424 Eddy's digital Roots
来源:互联网 发布:许晴家世 知乎 编辑:程序博客网 时间:2024/06/05 15:03
Eddy's digital Roots
时间限制:3000 ms | 内存限制:65535 KB
难度:2
- 描述
- 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.- 输入
- 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 n^n's digital root on a separate line of the output.
- 样例输入
240
- 样例输出
44
java:
import java.util.Scanner;
public class Roots {
private static int[] a = {9, 1, 4, 9, 4, 2, 9, 7, 1, 9, 1, 5, 9, 4, 7, 9, 7,
8, 9 };
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
int n = in.nextInt();
if (n == 0) {
break;
}
System.out.println(a[n % 18]);
}
}
}
- NYOJ 424 Eddy's digital Roots
- Eddy's digital Roots
- Eddy's digital Roots
- Eddy's digital Roots
- Eddy's digital Roots
- Eddy's digital Roots
- HDU1163 Eddy's digital Roots
- HDU1163:Eddy's digital Roots
- hdu1163-Eddy's digital Roots
- HDOJ Eddy's digital Roots
- HDU Eddy's digital Roots
- 1163:Eddy's digital Roots
- hdu1163 Eddy's digital Roots
- HDU1163 Eddy's digital Roots
- HDU1163 Eddy's digital Roots
- hdu1163 Eddy's digital Roots
- HDOJ1163 Eddy's digital Roots
- hdu 1163 Eddy's digital Roots
- Android ApiDemos示例解析(3): App->Activity->Animation
- 串行化
- A successful Git branching model
- HTTP Status 404 - Invalid path was requested
- MC9S12G128 串口通信
- NYOJ 424 Eddy's digital Roots
- const
- OnInitialUpdate
- 【IDE探究】VS2010中的调试技巧
- 需要谈谈的游戏测试(五)
- ASCII,Unicode和UTF-8,UTF-16
- JavaScript网页通用校验代码示例
- PatrolRoute(SRM542-div1-1-div2-2)
- ACM--楼层扔鸡蛋问题