> unsigned long pollard_rho(unsigned long n)
> {
>     unsigned long gcd_result;
>     
>     do {    
>         unsigned long x = true_random(n);
>         unsigned long a = 1;
>         unsigned long y;   // 注意
>     
>         x = (x*x + a) % n;
>         y = (y*y + a) % n; // 注意 unsigned long y;
>         
>         gcd_result = gcd(x-y, n);
>         
>         while(gcd_result == 1) {
>             x = (x*x + a) % n;
>     
>             y = (y*y + a) % n;
>             y = (y*y + a) % n;
>             
>             gcd_result = gcd(x-y, n);
>         }
>     } while(gcd_result == n);
>     
>     return gcd_result;
> }

• 这些都不如咱从使用算法分析上看的好用 (0) sunmoonstar_love 2005-08-17 23:43:34