代码菜鸡之CF刷题记录
文章平均质量分 92
xxatz
这个作者很懒,什么都没留下…
展开
-
刷题之Codeforces Round #783 (Div. 2)
文章目录刷题之Codeforces Round #783 (Div. 2)1668A. Direction Change1668B. Social Distance1668C. Make it Increasing1688D. Optimal Partition1688E. Half Queen Cover刷题之Codeforces Round #783 (Div. 2)比赛链接:Codeforces Round #783 (Div. 2)1668A. Direction Change思路:假设不原创 2022-04-20 20:53:27 · 310 阅读 · 0 评论 -
刷题之Educational Codeforces Round 125 (Rated for Div. 2)
文章目录刷题之Educational Codeforces Round 125 (Rated for Div. 2)1657A. Integer Moves1657B. XY Sequence1657C. Bracket Sequence Deletion1657D. For Gamers By Gamers1657E. Star MST刷题之Educational Codeforces Round 125 (Rated for Div. 2)题单链接:刷题之Educational Codeforces原创 2022-03-23 20:51:57 · 537 阅读 · 0 评论 -
刷题之Educational Codeforces Round 124 (Rated for Div. 2)
文章目录刷题之Educational Codeforces Round 124 (Rated for Div. 2)1651A. Playoff1651B. Prove Him Wrong1651C. Fault-tolerant Network1651D. Nearest Excluded Points刷题之Educational Codeforces Round 124 (Rated for Div. 2)题单链接:Educational Codeforces Round 124 (Rated fo原创 2022-03-11 18:07:04 · 381 阅读 · 0 评论 -
刷题之Codeforces Round #776 (Div. 3)
文章目录刷题之Codeforces Round #776 (Div. 3)1650A. Deletions of Two Adjacent Letters1650B. DIV + MOD1650C. Weight of the System of Nested Segments1650D. Twist the Permutation1650E. Rescheduling the Exam1650G. Counting Shortcuts刷题之Codeforces Round #776 (Div. 3)1原创 2022-03-09 21:24:57 · 349 阅读 · 0 评论 -
刷题之Codeforces Round #769 (Div. 2)
文章目录刷题之Codeforces Round #769 (Div. 2)1632A. ABC1632B. Roof Construction1632C. Strange Test1632D. New Year Concert刷题之Codeforces Round #769 (Div. 2)1632A. ABC题目链接:ABC题目:判断 01 字符串中是否包含回文子串思路:∣s∣≥3|s|\ge 3∣s∣≥3 :一定不满足∣s∣=2|s|=2∣s∣=2:sss 为 000000原创 2022-02-02 19:39:33 · 934 阅读 · 0 评论 -
刷题之Codeforces Round #767 (Div. 2)
文章目录刷题之Codeforces Round #767 (Div. 2)A. Download More RAMB. GCD ArraysC. Meximum ArrayD. Peculiar Movie Preferences刷题之Codeforces Round #767 (Div. 2)A. Download More RAM题目链接:Download More RAM类型:贪心思路:按照花费的内存排序,先用花费少的#include<bits/stdc++.h>原创 2022-01-23 13:37:27 · 608 阅读 · 0 评论 -
训练补题题解
文章目录2021/12/19 训练补题题解1. Fight Against Traffic3. New Year and Rating4. Sasha and a Bit of Relax5. Select Half6. Equals8. Trailing Loves (or L'oeufs?)2021/12/19 训练补题题解1. Fight Against Traffic题目链接:CF954D_Fight Against Traffic知识点:最短路题目:无权简单图中加一条边避免起原创 2021-12-20 19:46:02 · 200 阅读 · 0 评论 -
刷题之Codeforces Round #756 (Div. 3)
文章目录刷题之Codeforces Round #756 (Div. 3)[1611A]. Make Even[1611B]. Team Composition: Programmers and Mathematicians[1611C]. Polycarp Recovers the Permutation[1611D]. Weights Assignment For Tree Edges[1611E1]. Escape The Maze (easy version)[1611F]. ATM and Stu原创 2021-11-27 23:10:31 · 439 阅读 · 0 评论 -
刷题之Codeforces Round #757 (Div. 2)
文章目录刷题之Codeforces Round #757 (Div. 2)[1614A]. Divan and a Store[1614B]. Divan and a New Project[1614C]. Divan and bitwise operations刷题之Codeforces Round #757 (Div. 2)[1614A]. Divan and a Store思路:存入所有可选的,从小到大选择#include<bits/stdc++.h>using namesp原创 2021-11-27 15:01:08 · 188 阅读 · 0 评论 -
刷题之Codeforces Round #736 (Div2)
[1549A]. Gregor and Cryptography思路:对于一个质数,要随便找两个数a,ba,ba,b,使P mod a=P mod bP\bmod a=P\bmod bPmoda=Pmodb,可以使0=(P−x) mod a=(P−x) mod b0=(P-x)\bmod a=(P-x)\bmod b0=(P−x)moda=(P−x)modb,也可以想到使0=(P−x)=a×b0=(P-x)=a\times b0=(P−x)=a×b.#include<bits/stdc++.h原创 2021-08-08 18:04:23 · 143 阅读 · 0 评论 -
刷题之Codeforces Round #731 (Div. 3)
[1547A]. Shortest Path with Obstacle思路:FFF只有在A,BA,BA,B两位置与坐标平行的直线距离之间时才会影响(距离+2+2+2)#include<bits/stdc++.h>#define fora(i, a, b) for(int i = a; i <= b; i++)#define fors(i, a, b) for(int i = a; i >= b; i--)#define ll long long#define db原创 2021-07-15 21:19:18 · 114 阅读 · 0 评论 -
刷题之Codeforces Round #725 (Div. 3)
[1538A]. Stone Game思路:对于最大最小数都分别从左右统计距离,四选一比较可能的最小值#include<bits/stdc++.h>#define fora(i, a, b) for(int i = a; i <= b; i++)#define fors(i, a, b) for(int i = a; i >= b; i--)#define ll long longusing namespace std;int t, n, a[105];int m原创 2021-06-12 00:12:33 · 278 阅读 · 1 评论 -
刷题之Educational Codeforces Round 110 (Rated for Div. 2)
[1535A ]. Fair Playoff思路:实力最强(数值最大)的两个人需要分别在前俩和后俩中#include<bits/stdc++.h>#define fora(i, a, b) for(int i = a; i <= b; i++)#define fors(i, a, b) for(int i = a; i >= b; i--)#define ll long longusing namespace std;int t, s1, s2, s3, s4;int原创 2021-06-12 10:14:14 · 128 阅读 · 0 评论 -
刷题之Codeforces Round #723 (Div. 2)
[1526A]. Mean Inequality思路:为了防止任何连续的三个数单调,排序后可按照一半单增一半单减交叉排列#include<bits/stdc++.h>#define fora(i, a, b) for(int i = a; i <= b; i++)#define fors(i, a, b) for(int i = a; i >= b; i--)#define ll long longusing namespace std;int t, n;ll a原创 2021-06-12 09:47:19 · 153 阅读 · 0 评论