2022年1月24日
[CodeForces] A. Counting Kangaroos is Fun
摘要： A. Counting Kangaroos is Fun There can be only at most N / 2 hold and held pairs based the problem's statment. So a greedy approach is just to divide 阅读全文
posted @ 2022-01-24 12:52 Review->Improve 阅读(82) 评论(0) 推荐(0) 编辑