CORNACCHIA Algorithm * * GOAL: given d and p prime, find (x,y) such that x^2 + y^2 = d * p * * in this implementation, d = 1. This code does not accept d <> 1 !!! * see "A Course in Computational Algebraic Number Theory" by Henri

哈哈 好看的不得了，快点下啊。快点啊，快点啊-Haha extremely nice, quick next ah. Kuai Diana, Kuai Diana

哈希链表 为每个Hash值，建立一个Hash桶(Bucket)，桶的容量是固定的，也就是只能处理固定次数的冲突，如1048576个Hash桶，每个桶中有4个表项(Entry)，总计4M个表项。其实这两种的实现思路雷同，就是对Hash表中每个Hash值建立一个冲突表，即将冲突的几个记录以表的形式存储在其中；- * strmap version 2.0.1 * * ANSI C hash table for strings. * * Version hist