许开拓的专栏

11-散列4 Hashing - Hard Version   (30分)Given a hash table of size N, we can define a hash function . Suppose that the linear probing is used to solve collisions, we can easily obtain the statu

11-散列1 电话聊天狂人   (25分)给定大量手机用户通话记录，找出其中通话次数最多的聊天狂人。输入格式:输入首先给出正整数N（≤10​5​​），为通话记录条数。随后N行，每行给出一条通话记录。简单起见，这里只列出拨出方和接收方的11位数字构成的手机号码，其中以空格分隔。输出格式:在一行中给出聊天狂人的手机号码及其通话次数，其间以空格分隔。如果这

11-散列2 Hashing   (25分)The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of the input numbers. The hash function is

1004. Counting Leaves (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA family hierarchy is usually presented by a

PAT-A | 1095 | Cars on Campus (score-19) 解题报告。

PAT-A 1094 The Largest Generation 解题报告

03-树3 Tree Traversals Again   (25分)An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys n

PAT-A 1005 Spell It Right Solution Specification.

PAT-A 1003 Emergency 解答

PAT-A 1091 Acute Stroke 解题报告。