2016年2月1日
Codeforces Round #341 (Div. 2) A
摘要： Description Today, Wet Shark is given n integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisib 阅读全文
posted @ 2016-02-01 23:50 樱花落舞 阅读(162) 评论(0) 推荐(0) 编辑