| ||||||||||
| 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 | |||||||||
我觉得数据不应该考虑特殊情况,那样就有点搜索题的意思了。。。D的数据没有BT的,除了阶乘的小陷阱。其实说白了,这就是个大模拟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