随笔分类 -  2-sat

HDU 1672 Cuckoo Hashing
摘要：Cuckoo HashingDescriptionOne of the most fundamental data structure problems is the dictionary problem: given a set D of words you want to be able to ... 阅读全文
posted @ 2014-08-06 17:50 Estimator 阅读(372) 评论(0) 推荐(0)
Go Deeper（2010成都现场赛题）（2-sat）
摘要：G -Go DeeperTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluDescriptionHere is a procedure's pseudocode: go(int dep, int n, int m) ... 阅读全文
posted @ 2014-07-25 00:53 Estimator 阅读(221) 评论(0) 推荐(0)