M. Frequent Subsets Problem - 状态压缩-2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
Thefrequentsubsetproblemisdefinedasfollows.SupposeUUU={1,2,…\ldots…,N}istheuniverse,andS1S_{1}S1,S2S_{2}S2,…\ldots…,SMS_{M}SMareMMMsetsoverUUU.Givenapositiveconstantα\alphaα,0=M*α的题解:枚举子集,看其在M个集合中出现的次