假设哈希函数是完美的，即可以把输入数据均匀的分散在哈希表上。

哈希表大小为H，插入数据数量为K，求哈希表的冲突率，要推导过程。

具体一下：假设有20W待插入数据，Hash表大小为60W，求hash表的冲突率。-Suppose the hash function is perfect, that is, input data can be uniformly dispersed in the hash table. Hash table size H, insert the data quantity K, the rate of conflict in order to hash table should be derivation. Specifically this: assuming that there is 20W data to be inserted, Hash table size is 60W, the conflict in order to hash table rates.