![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
快速幂与同余
pupil_blue
这个作者很懒,什么都没留下…
展开
-
POJ-----3641快速幂
Pseudoprime numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8656 Accepted: 3634 Description Fermat's theorem states that for any prime number p a原创 2016-07-23 16:18:46 · 216 阅读 · 0 评论 -
HDOJ-----1097简单快速幂
Problem Description lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.原创 2016-07-18 17:18:22 · 671 阅读 · 0 评论 -
HDOJ-----2824The Euler function欧拉函数
The Euler function Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5724 Accepted Submission(s): 2414 Problem Description The Euler f原创 2016-08-22 14:53:28 · 338 阅读 · 0 评论 -
Light OJ-----1282对数快速幂
Description You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk. Input Input starts with an integer T (≤原创 2016-08-23 20:57:37 · 324 阅读 · 0 评论 -
HDOJ-----1575---Tr A矩阵快速幂
A为一个方阵,则Tr A表示A的迹(就是主对角线上各项的和),现要求Tr(A^k)%9973。 Input 数据的第一行是一个T,表示有T组数据。 每组数据的第一行有n(2 Output 对应每组数据,输出Tr(A^k)%9973。 Sample Input 2 2 2 1 0 0 1 3 99999999 1 2 3 4 5 6 7 8原创 2016-11-13 16:26:43 · 295 阅读 · 0 评论 -
HDOJ-----5666---Segment---加法快速幂
Segment Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1815 Accepted Submission(s): 669 Problem Description Silen August does原创 2017-03-12 11:24:09 · 307 阅读 · 0 评论