codeforces比赛
Froshine
加油!
展开
-
Educational Codeforces Round 116 (Rated for Div. 2)
比赛链接题目链接题解链接难度主要算法A. AB BalanceA. AB Balance900思维B. Update FilesB. Update Files1100暴力C. BanknotesC. Banknotes1400贪心D. Red-Blue Matrix2400E. ArenaE. Arena2100DP,组合数学...原创 2021-11-01 20:10:10 · 294 阅读 · 0 评论 -
Codeforces Round #751(A - C)
题目链接题解链接难度主要算法A. Two SubsequencesA. Two Subsequences800B. Divine ArrayB. Divine Array1100暴力C. Array EliminationC. Array Elimination1300思维,枚举D. Frog Traveler1900E. Optimal Insertion2300F. Difficult Mountain2700...原创 2021-10-26 15:57:43 · 191 阅读 · 0 评论 -
Codeforces Round #750 (Div. 2)(A - F1)
题目链接题解链接难度主要算法A. Luntik and ConcertsA. Luntik and Concerts(内附结论证明)思维B. Luntik and SubsequencesB. Luntik and Subsequences思维C. Grandma Capa Knits a ScarfC. Grandma Capa Knits a Scarf(本题解图文结合,理解更简单)思维,暴力D. Vupsen, Pupsen and 0D....原创 2021-10-25 19:13:41 · 256 阅读 · 0 评论 -
Codeforces Round #748 (Div. 3)
Codeforces Round #748 (Div. 3)比赛链接题目题解难度主要算法A. ElectionsA. Elections800B. Make it Divisible by 25B. Make it Divisible by 25900模拟C. Save More MiceC. Save More Mice1000贪心D1. All are SameD1. All are Same1100暴力,思维D2. Half原创 2021-10-14 20:01:39 · 198 阅读 · 0 评论 -
Codeforces Round #641 (Div. 2)
题目题解链接难度主要算法A. Orac and FactorsA. Orac and Factors900思维B. Orac and ModelsB. Orac and Models1400DPC. Orac and LCMC. Orac and LCM1600数论D. Orac and MediansD. Orac and Medians2000贪心,思维...原创 2021-09-13 14:30:14 · 86 阅读 · 0 评论 -
Educational Codeforces Round 113 (Rated for Div. 2)
题目题解链接难度主要算法A. Balanced SubstringA. Balanced Substring暴力B. Chess TournamentB. Chess Tournament思维C. Jury MeetingC. Jury Meeting思维,组合数学D. Inconvenient PairsD. Inconvenient Pairs思维...原创 2021-09-10 17:43:47 · 127 阅读 · 0 评论 -
Codeforces Round #643 (Div. 2)
题目题解链接难度主要算法A. Sequence with DigitsA. Sequence with Digits1200思维B. Young ExplorersB. Young Explorers1200贪心C. Count TrianglesC. Count Triangles1800差分,思维D. Game With ArrayD. Game With Array1400思维,构造E. Restorer DistanceE. ...原创 2021-09-07 14:25:11 · 79 阅读 · 0 评论 -
Codeforces Round #742 (Div. 2)
题目题解链接难度主要算法A. Domino DisasterA. Domino Disaster模拟B. MEXor MixupB. MEXor Mixup思维C. Carrying ConundrumC. Carrying Conundrum思维,DPD. Expression Evaluation ErrorD. Expression Evaluation Error思维,优先队列,递推E. Non-Decreasing Dilem...原创 2021-09-06 15:17:08 · 346 阅读 · 0 评论 -
Codeforces Round #689 (Div. 2)
题目题解链接难度主要算法A. String GenerationA. String Generation800简单思维B. Find the SpruceB. Find the Spruce1400暴力枚举C. Random EventsC. Random Events1500概率,模拟D. Divide and SummarizeD. Divide and Summarize1600二分,排序E. Water LevelE. Wat...原创 2021-08-20 12:12:34 · 133 阅读 · 0 评论 -
Codeforces Round #739 (Div. 3)
题目题解连接难度主要算法A. Dislike of ThreesA. Dislike of Threes模拟B. Who’s Opposite?B. Who’s Opposite?模拟,简单思维C. Infinity TableC. Infinity Table模拟,简单思维D. Make a Power of TwoD. Make a Power of Two枚举,暴力,思维E. Polycarp and String Transfo...原创 2021-08-19 15:35:15 · 209 阅读 · 0 评论 -
Codeforces Round #635 (Div. 2)
Codeforces Round #635 (Div. 2)题目题解链接难度主要做法A. Ichihime and Triangle A. Ichihime and Triangle 800简单思维B. Kana and Dragon Quest gameB. Kana and Dragon Quest game900贪心C. Linova and KingdomC. Linova and Kingdom1600排序 ,思维D. Xenia an原创 2021-08-18 19:11:38 · 83 阅读 · 0 评论 -
Codeforces Round #738 (Div. 2)(A,B,C,D1,D2)
Codeforces Round #738 Div. 2A. Mocha and MathB. Mocha and Red and BlueC. Mocha and HikingA. Mocha and Math题目大意:给出一个数组,你可以在任意大小的区间(大小不能为1)进行一个操作,区间元素与颠倒后的区间元素按位与,[ l , r ];a[l]=a[l]&a[r]a[l+1]=a[l+1]&a[r-1]…问经过任意次操作后数组中的最小值可能是多少思路:因为按位与的特性原创 2021-08-16 12:40:25 · 151 阅读 · 0 评论 -
Codeforces Round #737 (Div. 2) (A,B,C)
Codeforces Round #737 div 2A. Ezzat and Two SubsequencesB. Moamen and k-subarraysC. Moamen and XORA. Ezzat and Two Subsequences题目大意:把n个数分成两组,求两组的平均值之和的最大值思路:贪心,把最大的数单独分在一组,保证其值不被取平均值给缩小,其他的数分在另一组注意保留小数要大于7位AC代码:#include<bits/stdc++.h>#defin原创 2021-08-11 10:32:07 · 118 阅读 · 0 评论 -
Codeforces Round #736 (Div. 2) ( A,B,C)
目录A. Gregor and CryptographyB. Gregor and the Pawn GameC. Web of LiesA. Gregor and Cryptography题目大意:给出一个数p,找出两个数a,b,满足p%a = p%b思路:确定一个数,再去求另一个数比如说确定a是2,那么b就是p-p%2AC代码:#include<bits/stdc++.h>#define ll long long using namespace std;int mai原创 2021-08-02 10:47:02 · 127 阅读 · 0 评论 -
Codeforces Global Round 15(A,B)
目录A. Subsequence PermutationB. Running for GoldA. Subsequence Permutation题目大意:给你一个字符串,你可以选择其中k个字符,将这k个字符任意置换,使字典序最小,问最小的k思路: 将字符排序,如果排序后数组与原数组不同的字符都要选择,使其变换为排序后的数组AC代码:#include<bits/stdc++.h>#define ll long long using namespace std;const in原创 2021-07-29 08:41:09 · 98 阅读 · 0 评论 -
Codeforces Round #734 (Div. 3)题解(A、B1、B2、C)
目录A. Polycarp and CoinsA. Polycarp and Coins题目大意:有两种硬币,一种1块的,一种两块的,让你使用两种硬币表示一个数n,且两种硬币数量尽可能小思路:先算出用1块的和两块的和一起(即3块)需要用多少个,n/3再看余数,如果n%3 == 0,则刚好表示完n%3 == 1,则再需要一个1块的n%3 == 2 ,则再需要一个两块的AC代码:#include<bits/stdc++.h>#define ll long long usin原创 2021-07-25 09:07:39 · 122 阅读 · 1 评论