![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Number Theory
lzhf01
这个作者很懒,什么都没留下…
展开
-
A^B%C
1.当a,b,c都很小的时(如a,b,c2011-05-31 21:25:10 · 150 阅读 · 0 评论 -
一个公式的证明
我想证明的公式是:Ax≡A(x%phi(C)+phi(C)) (mod C) (x>=phi(C)) 其中phi(C)是指C的欧拉函数值,A,C,x均是正整数首先引入欧拉定理:对于任意的整数n>1,若gcd(a,n)=1,则aphi(n)≡1(mod n)由欧拉定理、鸽巢定理以及a0≡1(mod n),知ax%n是一个周期函数,且周期为phi(n)(此处就不证明了,其实...2011-06-03 15:39:48 · 112 阅读 · 0 评论 -
baby step,giant step
[url]http://en.wikipedia.org/wiki/Baby-step_giant-step[/url]2011-06-03 16:20:15 · 62 阅读 · 0 评论 -
Ural Brave Balloonists
Ural Brave Balloonists题目大意:给定10个数ai(12011-06-05 12:49:57 · 104 阅读 · 0 评论 -
Ural 1086. Cryptography
[align=center][size=large]Cryptography[/size][/align]题目大意:输入一个数n(n2011-06-05 13:35:40 · 79 阅读 · 0 评论 -
Ural 1091. Tmutarakan Exams
1091. Tmutarakan ExamsTime Limit: 1.0 secondMemory Limit: 16 MBUniversity of New Tmutarakan trains the first-class specialists in mental arithmetic. To enter the University you should master a...2011-06-05 23:46:42 · 123 阅读 · 0 评论 -
1104. Don’t Ask Woman about Her Age
1104. Don’t Ask Woman about Her AgeTime Limit: 1.0 secondMemory Limit: 16 MBMrs Little likes digits most of all. Every year she tries to make the best number of the year. She tries to become m...2011-06-06 00:09:29 · 157 阅读 · 0 评论