2020年5月4日
B2. K for the Price of One (Hard Version)
摘要： This is the hard version of this problem. The only difference is the constraint on kk — the number of gifts in the offer. In this version: 2≤k≤n2≤k≤n. 阅读全文
posted @ 2020-05-04 00:16 DeaL57 阅读(174) 评论(0) 推荐(0) 编辑