Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

无语了，这题的数据。超弱。小心设计的数据会让board里面写的那个方法死得很惨（26个错6个）。随机的数据也会让brute force很不好受的。

Posted by frkstyc at 2005-04-06 16:03:11 on Problem 1811
In Reply To:这个题好难搞啊！先是做了一个2~16381的素数表来brute force，又用汇编写了个64bit mul 64bit mod 64bit来搞miller-rabin和pollard rho，那些0.4k以下0ms的人到底怎么做的？ Posted by:frkstyc at 2005-03-21 13:20:36 
> 素数表里面1900个素数真是很耗文件长度啊
> 再次体会到fpu control word的重要性，改了精度设置fild和fprem就不会错，pollard rho就不会死循环了
> 从前为了数论变换做的handcoded assembly貌似还是对的
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

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