codeforces、
文章平均质量分 79
Yokile_
不知道
展开
-
Manthan, Codefest 18 (rated, Div. 1 + Div. 2) 简单题
A 题意: 把n个硬币分成几部分, 某些部分的和能组成1~n范围内的所有整数#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <ctime>#include &a原创 2018-09-04 16:17:44 · 339 阅读 · 0 评论 -
Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-10-07 18:37:08 · 298 阅读 · 0 评论 -
Codeforces Round #431 (Div. 2)
A#includeusing namespace std;#define LL long long#define pb push_back#define mk make_pair#define mst(a, b) memset(a, b, sizeof a)const int qq = 2e5 + 10;const int MOD = 1e9 + 7;int n, m, k;原创 2017-09-03 11:51:55 · 195 阅读 · 0 评论 -
Manthan, Codefest 17
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-09-26 18:43:21 · 535 阅读 · 0 评论 -
Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)
A题意:给出一个n,一个k,问你n * m 后 末尾最少有k个0,求最小的n * m#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #inc原创 2017-09-18 01:44:51 · 385 阅读 · 0 评论 -
Codeforces Round #436 (Div. 2)
A判断只有两种数字并且他们的数量是相等的By _sasuke, contest: Codeforces Round #436 (Div. 2), problem: (A) Fair Game, Accepted, ##include #include #include #include #include #include #include #include #inclu原创 2017-09-26 14:55:58 · 236 阅读 · 0 评论 -
Codeforces Round #430 (Div. 2)
A写了一个二分判断#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-09-08 19:39:11 · 179 阅读 · 0 评论 -
Educational Codeforces Round 28
A题意:可以删除一些数,但不能改变其位置,并且1的右边不能有1,问最后最多剩下多少数思路:很显然如果存在一个1那么右边不可能存在0,所以对1做一个后缀,从前向后考虑,每碰到一个1就判断不删掉这个1的最大值#include #include #include #include #include #include #include #include #include #i原创 2017-09-06 20:16:19 · 321 阅读 · 0 评论 -
Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#def原创 2017-09-07 14:07:05 · 149 阅读 · 0 评论 -
Educational Codeforces Round 29
A把末尾的0删除然后匹配#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#d原创 2017-09-23 11:23:26 · 356 阅读 · 0 评论 -
Educational Codeforces Round 27
A题意:把2 * n个人分成两组,使得无论两组的人怎么进行比赛 第一组的人始终都要保持全赢,如果两个人能力值相等两人都可以赢思路:排序后只要保证n + 1个人的能力值大于第n个人的能力值即可#include #include #include #include #include #include #include #include #include #include原创 2017-08-23 10:35:32 · 624 阅读 · 0 评论 -
Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#def原创 2017-09-05 09:23:46 · 232 阅读 · 0 评论 -
Codeforces Round #428 (Div. 2)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#def原创 2017-08-13 10:44:52 · 207 阅读 · 0 评论 -
Codeforces Round #429 (Div. 2)
A判断一下某个字符是不是比k大根据鸽笼原理即可知道至少有一个人会分到两种相同的颜色#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include us原创 2017-08-19 20:03:50 · 180 阅读 · 0 评论 -
Educational Codeforces Round 26
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#def原创 2017-08-04 16:25:57 · 438 阅读 · 0 评论 -
Codeforces Round #427 (Div. 2)
A懂题意就没什么问题了、#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL l原创 2017-08-01 11:08:04 · 275 阅读 · 0 评论 -
Codeforces Round #435 (Div. 2)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-09-21 15:20:32 · 157 阅读 · 0 评论 -
2015-2016 Northwestern European Regional Contest (NWERC 2015)
A题意:给出n,m,然后给出n个人到达的时间以及这个人在实验室所待的时间,实验室有无穷个房间,一般情况下某个房间的人离开后会直接锁房,但是Penelope很懒,不想开锁,所以她可以告诉某个人不锁房,以便下一个人来使用,但是在某个房间的人离开后m分钟房门会自动锁住,求Penelope最多可以节省几次开锁的次数思路:排序一下,然后用优先队列维护一下右端点的值,每次来人就判断一下#inclu原创 2017-10-18 17:16:13 · 297 阅读 · 0 评论 -
Codeforces Round #467 (Div. 2)
A统计一下出现了多少个大于0的数字就行#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace原创 2018-03-05 17:15:57 · 159 阅读 · 0 评论 -
Hello 2018
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2018-01-09 13:17:04 · 272 阅读 · 0 评论 -
Educational Codeforces Round 35 (Rated for Div. 2)
A注意是数组中最小那个数的最近相邻距离#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace原创 2017-12-30 13:02:10 · 206 阅读 · 0 评论 -
Codeforces Round #449 (Div. 2)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-12-06 23:50:38 · 134 阅读 · 0 评论 -
Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)
A直接二进制枚举所有情况#includeusing namespace std;#define LL long long#define mst(a, b) memset(a, b, sizeof a)#define pb push_back#define mk makr_pair#define pill pair#define fi first#define se sec原创 2017-11-25 10:40:58 · 178 阅读 · 0 评论 -
Educational Codeforces Round 33 (Rated for Div. 2)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-11-24 20:51:33 · 333 阅读 · 0 评论 -
2017年浙江工业大学大学生程序设计迎新赛热身赛
吐槽一下,这套题作为迎新热身好像有点难阿A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using nam原创 2017-12-14 22:00:08 · 1055 阅读 · 0 评论 -
Codeforces Round #446 (Div. 2)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-11-20 15:08:53 · 150 阅读 · 0 评论 -
Codeforces Round #442 (Div. 2)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-10-26 13:50:41 · 282 阅读 · 0 评论 -
Educational Codeforces Round 32
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-11-11 13:16:16 · 244 阅读 · 0 评论 -
Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
A#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long原创 2017-10-16 13:21:36 · 137 阅读 · 0 评论 -
2016-2017 ACM-ICPC, NEERC, Central Subregional Contest
A题意:有n条鱼,每条鱼要烤两面,每次可以烤k条鱼,问你最小烤鱼的次数思路:我这里是有优先队列模拟的过程,因为数据小。#include #include #include #include #include #include #include #include #include #include #include #include #include #in原创 2017-10-24 15:34:35 · 356 阅读 · 0 评论 -
2017 JUST Programming Contest 4.0
A题意:求所有区间的&和思路:我们统计二进制中每一位的贡献,很显然如果连续一段区间二进制中某一位都为1,那么这个区间的任何子区间都满足答案,所以我们直接统计满足条件的子区间个数即可#include #include #include #include #include #include #include #include #include #include #inc原创 2017-10-24 15:06:24 · 616 阅读 · 0 评论 -
Educational Codeforces Round 31
A#includeusing namespace std;#define LL long long#define mst(a, b) memset(a, b, sizeof a)#define pb push_backconst int qq = 1e5 + 10;const int MOD = 1e9 + 7;const int INF = 1e9 + 10;int num原创 2017-10-31 23:41:52 · 189 阅读 · 0 评论 -
Codeforces Round #443 (Div. 2)
A比较傻用了二分#includeusing namespace std;#define LL long long#define mst(a, b) memset(a, b, sizeof a)#define pb push_backconst int qq = 1e7 + 10;const int MOD = 1e9 + 7;const int INF = 1e9 + 10原创 2017-10-31 23:18:59 · 268 阅读 · 0 评论 -
Codeforces Round #426 (Div. 2)
A题意:给出两个字符,在所给次数情况下,问第一个字符旋转到第二个字符是顺时针方向还是逆时针方向或者都可以思路:直接判断即可#include #include #include #include #include #include #include #include #include #include #include #include #include us原创 2017-07-31 12:46:54 · 316 阅读 · 0 评论 -
Educational Codeforces Round 25
A#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#define pb push_back#define mk ma原创 2017-07-17 20:20:50 · 375 阅读 · 0 评论 -
Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)
A#include #include #include #include #include #include using namespace std;#define LL long long#define pb push_back#define mk make_pair#define pill pair#define mst(a, b) memset(a, b, siz原创 2017-07-15 16:44:45 · 188 阅读 · 0 评论 -
Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)
A欧拉回路即可#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define qq 1e5 + 10#define REP(i, x,原创 2017-03-04 13:08:27 · 367 阅读 · 0 评论 -
Codeforces Round #401 (Div. 2)
A可以發現是有周期的, 第一次操作無論如何都是進行左中操作, 第二次也是無論如何都是進行中右操作所以枚舉地點位置即可.#include #include #include #include #include #include #include #include #include #include #include #include #include usin原创 2017-02-25 09:53:24 · 161 阅读 · 0 评论 -
Codeforces Round #394 (Div. 2)
A注意0 0 这种特殊情况#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef lon原创 2017-02-01 09:56:31 · 173 阅读 · 0 评论 -
Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)
A#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;const int qq = 1e5 + 10原创 2017-02-22 20:11:29 · 298 阅读 · 0 评论