HDU1163 Eddy's digital Roots【九余数定理】
来源:互联网 发布:杭州美迪软件 编辑:程序博客网 时间:2024/06/08 13:43
Eddy's digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4436 Accepted Submission(s): 2505
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
Author
eddy
九余数定理:一个数对9取余所得为九余数。一个数的九余数等于该数的各位和对9取余。
#include <stdio.h>int main(){ int n, i, ans; while(scanf("%d", &n), n){ ans = 1; for(i = 1; i <= n; ++i) ans = n * ans % 9; if(!ans) ans = 9; printf("%d\n", ans); } return 0;}
0 0
- HDU1163 Eddy's digital Roots【九余数定理】
- HDU1163 Eddy's digital Roots(快速幂+九余数定理)
- HDU1163 Eddy's digital Roots(解法二)【快速模幂+九余数定理】
- Hdu1163 Eddy's digitai Roots(九余数定理)
- Hdu-1163 Eddy's digital Roots(九余数定理)
- [ACM - 数论]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【九余数定理】
- Eddy's digital Roots 1163 (数学+九余数定理)
- Hdu 1163 Eddy's digital Roots(九余数定理)
- HDU 1163 Eddy's digital Roots(九余数定理)
- [数学 九余数定理] HDU 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
- ugg 0441 wgqb boots sale schweiz outlet
- ugg 2939 sdyb boots sale schweiz outlet
- ugg 3058 jgiy boots sale schweiz outlet
- 反汇编工具使用
- 博弈:巴什博奕(Bash Game)威佐夫博奕(Wythoff Game)尼姆博奕(Nimm Game)
- HDU1163 Eddy's digital Roots【九余数定理】
- 跳槽指南(5)--各类公司的利弊
- Bottle实例Todo-List—编辑数据库中的记录
- JDBC连接数据库的完整代码
- 试读《互联网创业密码》有感
- directshow+opencv打开easycap摄像头
- struts2拦截器配置
- Codeforces Round #261 (Div. 2) E. Pashmak and Graph DP
- List和Array直接的互相转换,Arrays.asList(),list.toArray()