 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
我们考虑的都是最普通的情况,倒是没想这么复杂,不过以后一定会多加注意的,多谢诸位大牛的建议.In Reply To:不一定就是lg(b)了。举个例子（虽然是特殊情况）当gcd(a,m)=1时，a^b mod m = a^(b%(phi(m))) mod m。这样只需要lg(m)的复杂度 Posted by:RoBa at 2007-10-07 21:05:11 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
