HDU1163 Eddy's digital Roots(快速幂+九余数定理)
来源:互联网 发布:2017软件设计师报名 编辑:程序博客网 时间:2024/06/08 11:48
Eddy’s digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6171 Accepted Submission(s): 3404
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
日常水题系列
#include<cstdio>int my(int n,int m){ int t=n,ans=1; while(m){ if(m&1){ ans*=t; ans%=9; if(ans==0)ans=9; } t*=t; t%=9; if(t==0)t=9; m>>=1; } ans=ans%9; if(ans==0)ans=9; return ans;}int main(){ int n; while(~scanf("%d",&n)&&n){ if(n==0){ printf("1\n");continue; } printf("%d\n",my(n,n)); } return 0;}
- HDU1163 Eddy's digital Roots(快速幂+九余数定理)
- HDU1163 Eddy's digital Roots(解法二)【快速模幂+九余数定理】
- HDU1163 Eddy's digital Roots【九余数定理】
- 快速幂定理和九余数定理(Eddy's digital Roots)
- Hdu1163 Eddy's digitai Roots(九余数定理)
- hdu 1163 Eddy's digital Roots(九余数定理,快速幂)
- HDU 1163 Eddy's digital 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
- Scala入门之控制结构
- javaweb之jsp
- GIT教程
- 【Tyvj P1004】滑雪
- java中request常用方法小结
- HDU1163 Eddy's digital Roots(快速幂+九余数定理)
- Python使用SQLAlchemy,并且解决了插入中文乱码问题
- caffe源码解析的三个博客分享
- Java拦截器的小例子
- 关于JQUERY的DataTable插件的使用过程笔记【持续更新中……】
- 邻接矩阵存储的图的基本操作c++
- 转发和重定向
- POJ 2155 Matrix <树状数组 + 矩阵翻转>
- 对数学的新思考[4 ]