Detail of message

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

这个题long long 就够了吧

Posted by sunmoonstar_love at 2005-08-22 22:34:29 on Problem 1811
In Reply To:这个除暴力外的方法，就不知道了，同问 Posted by:sunmoonstar_love at 2005-08-22 22:33:06

Followed by:

是2^52呀,晕... (0) JiangLY 2005-08-22 22:35:37
- 还是不知道怎么快,做个2^27的表要超... (0) JiangLY 2005-08-22 22:36:48
  - long long = 2^64? (0) sunmoonstar_love 2005-08-22 22:40:15
  - 暴力破解吧，表不用很大的，实在不行就上汇编...__int64就够了... (0) sothink 2005-08-22 22:45:54
    - pollard_rho就行了 (0) sunmoonstar_love 2005-08-22 22:47:26
      - Miller Rabin判pseudoprime，Pollard-rho做分解 (0) Ikki 2005-08-23 11:47:17
        Re:Miller Rabin判pseudoprime，Pollard-rho做分解 (3) liuyuyangfoam 2005-12-21 03:35:45
        Pollard-rho分解的时候需要平方的，一个不超过2^54的数平方不是要超出INT64了么？要写高精度？ (0) cmc_hope 2007-03-08 13:20:28
        平方后还要模一个数吧，所以用二分 (0) alpc02 2007-03-08 14:50:58
        请问怎么求平方之后模那个数的余数呢？ (0) cmc_hope 2007-03-08 15:59:15
        Re:请问怎么求平方之后模那个数的余数呢？ (63) alpc02 2007-03-09 08:14:03
        Re:请问怎么求平方之后模那个数的余数呢？ (71) harkue 2007-08-06 11:18:48

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator