摘要：
Count Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1187 Accepted Submission(s): 433 Problem De 阅读全文
摘要：
C. Party Lemonade C. Party Lemonade A New Year party is not a New Year party without lemonade! As usual, you are expecting a lot of guests, and buying 阅读全文
摘要：
扫雷 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4861 Accepted Submission(s): 1316 Problem Desc 阅读全文
摘要：
B. Divisiblity of Differences You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between an 阅读全文
摘要：
B. Marvolo Gaunt's Ring Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present th 阅读全文
摘要：
B. Maximum of Maximums of Minimums You are given an array a1, a2, ..., an consisting of n integers, and an integer k. You have to split the array into 阅读全文
摘要：
A. Odds and Ends A. Odds and Ends Where do odds begin, and where do they end? Where does hope emerge, and will they ever break? Given an integer seque 阅读全文