hdoj-1163-Eddy's digital Roots【九余数定理】
来源:互联网 发布:35mm定焦镜头推荐 知乎 编辑:程序博客网 时间:2024/05/21 10:32
Eddy's digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5125 Accepted Submission(s): 2861
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
Recommend
JGShining | We have carefully selected several similar problems for you:11571194 1014 1141 1178
#include<stdio.h>int _pow(int a,int b){if(b==0) return 1;if(b==1) return a%9;int res=_pow(a,b/2);res=res*res%9;if(b&1) res=res*a%9;return res%9;}int main(){int n;while(~scanf("%d",&n),n){int t=_pow(n,n);if(t)printf("%d\n",t);elseprintf("9\n");}return 0;}
九余数定理:一个数的各个数位上的数之和 = 它的九余数(九余数是指对9取余数)
数学简直太强大了,居然还有这定理!!
*********************************修改于:2015年8月8日08:26:14*******************************************
九余数定理的证明:
同余定理:
因为: 10 = 1 mod(3) ; 10 = 1 mod(9);
a = a0*10^p1+ a1*10^p2+....+an-1*10^pn;
a % 9 = (a0*10^p1+ a1*10^p2+....+an-1*10^pn) % 9
= (a0%9 + a1%9 + a2%9+.......+an%9)%9;
同理可证模为3的情况;
结论:一整数能被 3(9)整除的充要条件为:它的十进制各个数码的和能被 3(9)整除;
0 0
- hdoj-1163-Eddy's digital Roots【九余数定理】
- Hdu-1163 Eddy's digital Roots(九余数定理)
- hdu 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
- HDOJ 1163 Eddy's digital Roots(九余数定理的应用)
- [ACM - 数论]Eddy's digital Roots(九余数定理)
- 九余数定理——hdu_1163 Eddy's digital Roots
- HDU1163 Eddy's digital Roots【九余数定理】
- HDU1163 Eddy's digital Roots(快速幂+九余数定理)
- HDU——1163Eddy's digital Roots(九余数定理+同余定理)
- HDU——1163Eddy's digital Roots(九余数定理+同余定理)
- 杭电1163--Eddy's digital Roots (九余数定理)
- hdu 1163 Eddy's digital Roots(九余数定理,快速幂)
- Hdu 1163 Eddy's digital Roots + NYOJ-485 A*B Problem(九余数定理)
- 使用Cocoapods的pod install 时各种慢 教你一招秒下载第三方开源库
- dmp文件导入导出oracle数据库命令
- java可变参数使用总结
- map与set
- HDU 1712 分组背包
- hdoj-1163-Eddy's digital Roots【九余数定理】
- 函数指针回调函数
- mysql安装流程
- 使用JS获取多组radio的value并判断是否选中
- 工作篇-电商项目需求总结下
- 技术与经济之一:关于市场与“紧缩政策”的讨论
- hadoop学习笔记(HDFS)
- CoreData的使用
- Arcengine开发基础