2019年4月25日
HDU 3486 Interviewe
摘要： http://acm.hdu.edu.cn/showproblem.php?pid=3486 Problem Description YaoYao has a company and he wants to employ m people recently. Since his company is 阅读全文
posted @ 2019-04-25 11:01 _Zlrrr 阅读(197) 评论(0) 推荐(0)
CodeForces Round #554 Div.2
摘要： A. Neko Finds Grapes 代码： #include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int N, M; int a[maxn], b[maxn]; int odda = 0, evea = 阅读全文
posted @ 2019-04-25 10:52 _Zlrrr 阅读(212) 评论(0) 推荐(0)