2016年11月2日

Largest Divisible Subset

摘要： Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or 阅读全文

posted @ 2016-11-02 12:21 ShinningWu 阅读(208) 评论(0) 推荐(0)

导航