ACM--比赛补题
文章平均质量分 81
ACM--比赛补题
「已注销」
“没有人能把你变好,
时间和经历只是陪衬。
支撑你变得越来越好的,是你坚强的意志、修养、品行,以及不断的反思和修正。”
展开
-
2017-2018 ACM-ICPC German Collegiate Programming Contest (GCPC 2017)
文章目录2017-2018 ACM-ICPC German Collegiate Programming Contest (GCPC 2017)A.Drawing BordersB.BuildingsC.JoyrideD.Pants On FireE. Perpetuum MobileF.Plug It In!G.Water TestingH.RatatoskrI.UberwatchK.You Are Fired2017-2018 ACM-ICPC German Collegiate Programmin原创 2020-09-16 18:02:26 · 547 阅读 · 0 评论 -
2014-2015 ACM-ICPC, Asia Tokyo Regional Contest
文章目录2014-2015 ACM-ICPC, Asia Tokyo Regional ContestA.Bit String ReorderingB.MiscalculationC.ShoppingD.Space GolfF.There is No AlternativeG.Flipping Parentheses2014-2015 ACM-ICPC, Asia Tokyo Regional Contest A.Bit String Reordering B.Miscalculation C.S原创 2020-09-16 18:00:45 · 341 阅读 · 0 评论 -
AtCoder Beginner Contest 210
文章目录AtCoder Beginner Contest 210A - CabbagesB - Bouzu MekuriC - Colorful CandiesD - National RailwayE - Ring MSTAtCoder Beginner Contest 210A - Cabbages题意:题解:代码:#include <bits/stdc++.h>#define int long long#define debug(x) cout << #x &原创 2021-08-10 18:46:11 · 123 阅读 · 0 评论 -
AtCoder Beginner Contest 209
文章目录AtCoder Beginner Contest 209A - CountingB - Can you buy them all?C - Not EqualD - CollisionE - ShiritoriF - DeforestationAtCoder Beginner Contest 209A - Counting题意:题解:代码:#include <bits/stdc++.h>#define int long long#define debug(x) cout原创 2021-08-06 15:52:54 · 263 阅读 · 1 评论 -
AtCoder Beginner Contest 208
文章目录AtCoder Beginner Contest 208A - Rolling DiceB - Factorial Yen CoinC - Fair Candy DistributionD - Shortest Path Queries 2E - Digit ProductsF - Cumulative SumAtCoder Beginner Contest 208A - Rolling Dice题意:题解:代码:#include <bits/stdc++.h>#defi原创 2021-08-05 19:19:28 · 308 阅读 · 0 评论 -
AtCoder Beginner Contest 207
文章目录AtCoder Beginner Contest 207A - RepressionB - HydrateC - Many SegmentsD - Congruence PointsE - Mod iAtCoder Beginner Contest 207A - Repression题意:题解:代码:#include <bits/stdc++.h>#define int long long#define debug(x) cout << #x <<原创 2021-08-01 21:35:19 · 262 阅读 · 1 评论 -
AtCoder Beginner Contest 045
文章目录AtCoder Beginner Contest 045A - Trapezoids**B - Card Game for Three (ABC Edit)****C - Many Formulas****D - Snuke's Coloring**AtCoder Beginner Contest 045A - Trapezoids题意:题解:代码:#include <bits/stdc++.h>#define int long long#define debug(x)原创 2021-07-03 19:44:54 · 293 阅读 · 0 评论 -
Codeforces Round #726 (Div. 2)
文章目录Codeforces Round #726 (Div. 2)A. Arithmetic ArrayB. Bad BoyC. Challenging CliffsD. Deleting DivisorsE1. Erase and Extend (Easy Version)Codeforces Round #726 (Div. 2)A. Arithmetic Array题意:题解:代码:#include <bits/stdc++.h>#define int long long原创 2021-07-02 21:26:02 · 80 阅读 · 0 评论 -
AtCoder Beginner Contest 206
文章目录AtCoder Beginner Contest 206A - Maxi-BuyingB - SavingsC - SwappableD - KAIBUNsyoE - Divide BothF - Interval Game 2AtCoder Beginner Contest 206A - Maxi-Buying题意:题解:代码:#include <bits/stdc++.h>#define int long long#define debug(x) cout <原创 2021-06-30 08:46:57 · 324 阅读 · 0 评论 -
上海理工大学第二届“联想杯”全国程序设计邀请赛
文章目录上海理工大学第二届“联想杯”全国程序设计邀请赛A.A-SOUL!B.Bheith i ngra leC.Counting Cats!D.Dahno DahnoE.Experiment ClassI.Identical DayJ.JXC&JesusK.Kazusa’s PartyL.Little Witch AcademiaM.Minecraft上海理工大学第二届“联想杯”全国程序设计邀请赛A.A-SOUL!题意:题解:代码:#include <b原创 2021-06-24 19:16:22 · 380 阅读 · 1 评论 -
AtCoder Beginner Contest 043
文章目录AtCoder Beginner Contest 043A - Children and Candies (ABC Edit)B - Unhappy Hacking (ABC Edit)C - Be TogetherD - UnbalancedAtCoder Beginner Contest 043A - Children and Candies (ABC Edit)题意:题解:代码:#include <bits/stdc++.h>#define int long lon原创 2021-06-24 11:22:37 · 107 阅读 · 0 评论 -
AtCoder Beginner Contest 042
文章目录AtCoder Beginner Contest 042**A - Iroha and Haiku (ABC Edition)****B - Iroha Loves Strings (ABC Edition)****C - Iroha's Obsession****D - Iroha and a Grid**AtCoder Beginner Contest 042A - Iroha and Haiku (ABC Edition)题意:题解:代码:#include <bits/std原创 2021-06-24 11:22:05 · 124 阅读 · 0 评论 -
AtCoder Beginner Contest 044
文章目录AtCoder Beginner Contest 044A - Tak and Hotels (ABC Edit)B - Beautiful StringsC - Tak and CardsD - Digit SumAtCoder Beginner Contest 044A - Tak and Hotels (ABC Edit)题意:题解:代码:#include <bits/stdc++.h>#define int long long#define debug(x) c原创 2021-06-24 11:21:32 · 120 阅读 · 0 评论 -
AtCoder Beginner Contest 205
文章目录AtCoder Beginner Contest 205A - kcalB - Permutation CheckC - POWD - Kth ExcludedE - White and Black BallsF - Grid and TokensAtCoder Beginner Contest 205A - kcal题意:题解:代码:#include <bits/stdc++.h>#define int long long#define debug(x) cout &原创 2021-06-14 20:38:20 · 283 阅读 · 5 评论 -
第十一届蓝桥杯C++省赛B组第二场
第十一届蓝桥杯C++省赛B组第二场试题A:门牌制作题目【问题描述】小蓝要为一条街的住户制作门牌号。这条街一共有2020位住户,门牌号从1到2020编号。小蓝制作门牌的方法是先制作0到9这几个数字字符,最后根据需要将字符粘贴到门牌上,例如门牌1017需要依次粘贴字符1、0、1、7,即需要1个字符0,2个字符1,1个字符7。请问要制作所有的1到2020号门牌,总共需要多少个字符2?【答案提交】这是一道结果填空的题,你只需要算出结果后提交即可。本题的结果为一个整数,在提交答案时只填写这个整数,填写多余的内原创 2021-04-15 20:29:42 · 93 阅读 · 0 评论 -
第十一届蓝桥杯C++省赛B组第二场
第十一届蓝桥杯C++省赛B组第二场试题A:门牌制作题目【问题描述】小蓝要为一条街的住户制作门牌号。这条街一共有2020位住户,门牌号从1到2020编号。小蓝制作门牌的方法是先制作0到9这几个数字字符,最后根据需要将字符粘贴到门牌上,例如门牌1017需要依次粘贴字符1、0、1、7,即需要1个字符0,2个字符1,1个字符7。请问要制作所有的1到2020号门牌,总共需要多少个字符2?【答案提交】这是一道结果填空的题,你只需要算出结果后提交即可。本题的结果为一个整数,在提交答案时只填写这个整数,填写多余的内原创 2021-04-15 20:26:37 · 79 阅读 · 0 评论 -
第二届全国大学生算法设计与编程挑战赛(冬季赛)
第二届全国大学生算法设计与编程挑战赛(冬季赛)文章目录第二届全国大学生算法设计与编程挑战赛(冬季赛)A 塔B 日记E 神仙爱采药F 但更爱字符串I 奇怪的传输机增加了J 奇怪的小鸭子也增加了K 关于哥俩好的数字这件事M 出题人说这道题是一个签到题A 塔签到#include<iostream>using namespace std;int main(){ char c1; int n=26; //设定塔的层数为26 for(int i=1;i<=n;i++){ //对塔每原创 2021-03-19 09:58:47 · 860 阅读 · 0 评论 -
2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019)
文章目录2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019)B. Level UpD. Cycle String?F. Game on a TreeG. ProjectionI. Absolute GameJ. Graph and Cycles2019-2020 ICPC Southeastern European Regional Programming Contest (SEERC 2019)B.原创 2021-03-19 09:49:40 · 440 阅读 · 0 评论 -
2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)
2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)文章目录2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)A Radio PrizeB Perfect FlushC Coloring ContentionD Dividing by TwoE Rainbow StringsI Error CorrectionJ Interstellar TravelK.Com原创 2021-03-18 22:18:38 · 449 阅读 · 0 评论 -
Codeforces Round #616 (Div. 2)
文章目录Codeforces Round #616 (Div. 2)A. Even But Not EvenB. Array SharpeningC. Mind ControlD. Irreducible AnagramsCodeforces Round #616 (Div. 2)A. Even But Not Even#include <bits/stdc++.h>#define int long longusing namespace std;int const MAXN =原创 2021-03-09 19:03:07 · 65 阅读 · 0 评论 -
ICPC 2019-2020 North-Western Russia Regional Contest
ICPC 2019-2020 North-Western Russia Regional Contest文章目录ICPC 2019-2020 North-Western Russia Regional ContestA - Accurate MovementB - Bad TreapE - EquidistantH - High Load DatabaseI - Ideal PyramidJ - Just the Last DigitM - Managing DifficultiesA - Accura原创 2021-03-07 20:38:53 · 326 阅读 · 0 评论 -
Codeforces Round #704 (Div. 2)
文章目录Codeforces Round #704 (Div. 2)C. Maximum widthD. Genius's GambitCodeforces Round #704 (Div. 2)C. Maximum width题意: 给定s串和t串,问是否能够从s中选择若干字符构成t串,要求s中选择出来的相邻的位置的最大值最大题解: 预处理出t中每个字符能够属于的左右区间,然后枚举下即可代码:#include <bits/stdc++.h>using namespace std原创 2021-03-07 20:11:48 · 100 阅读 · 0 评论 -
Codeforces Global Round 13
文章目录Codeforces Global Round 13E. Fib-treeCodeforces Global Round 13E. Fib-tree题意:给你一棵节点为n(1≤n≤2e5)的树你要判断这颗树是否是斐波树满足下列两点之一即为斐波树1:删除一些边,使得这颗树变为两棵斐波树2:只有一个节点斐波树要求节点数量必须是斐波那契值题解: 题解:https://www.cnblogs.com/mollnn/p/14473024.html代码:贴上大佬的代码:https://w原创 2021-03-07 20:09:00 · 101 阅读 · 0 评论 -
Codeforces Round #620 (Div. 2)
文章目录Codeforces Round #620 (Div. 2)C. Air ConditionerD. Shortest and Longest LISE. 1-Trees and QueriesCodeforces Round #620 (Div. 2)C. Air Conditioner题解: 先对顾客到店的时间进行排序,之后对于每一个顾客判断[Li , Ri] 与 [LI - t ,Ri + t] 是否有交集即可D. Shortest and Longest LIS题意: 先给你一个数原创 2021-03-07 19:33:59 · 74 阅读 · 0 评论 -
Codeforces Round #619 (Div. 2)
文章目录Codeforces Round #619 (Div. 2)B - Motarack’s BirthdayC - Ayoub's functionE. NanosoftCodeforces Round #619 (Div. 2)B - Motarack’s Birthday题意:题解: 中位数。填完之后使得相邻数字差值的绝对值和最小,那么我就填中位数即可代码:C - Ayoub’s function题意:题解: 组合计数。逆向思考,我先求出所有的分段数目,然后减掉全部为0的分段即可。原创 2021-03-07 18:58:31 · 64 阅读 · 0 评论 -
Codeforces Round #651 (Div. 2)
文章目录Codeforces Round #651 (Div. 2)A. Maximum GCDB. GCD CompressionC. Number GameD. Odd-Even SubsequenceE. Binary Subsequence RotationCodeforces Round #651 (Div. 2)A. Maximum GCD题意: 给定n,找到1 < a < b <= n,使得gcd(a, b)最大题解: 思维+数学。分析可知,找到的a和b,必然成倍数关原创 2021-03-05 16:32:21 · 68 阅读 · 0 评论 -
Codeforces Round #652 (Div. 2)
文章目录Codeforces Round #652 (Div. 2)C. RationalLeeD. TediousLeeE. DeadLeeCodeforces Round #652 (Div. 2)C. RationalLee题意: 给你n个数,有m个朋友,每个朋友要拿其中w[i]个数,每个人获得的贡献是他拿的数的最大值加最小值,如果只有一个数最大值最小值都是它,让你求出所有人能获得的最大贡献是多少?题解: 贪心。我们要尽可能地将大的数字作为小朋友获得的max值,然后如果给每个小朋友的max分配原创 2021-03-02 15:54:29 · 71 阅读 · 0 评论 -
Codeforces Round #672 (Div. 2)
文章目录Codeforces Round #672 (Div. 2)C1. Pokémon Army (easy version)C2. Pokémon Army (hard version)D. Rescue Nibel!Codeforces Round #672 (Div. 2)C1. Pokémon Army (easy version)题意: 给定n个数字,可以从这n个数字中选择k个,使得res=a1−a2+a3−a4+...+akres = a_1 - a_2 + a_3 - a_4 +..原创 2021-03-01 20:42:44 · 75 阅读 · 0 评论 -
ICPC Central Russia Regional Contest (CRRC 19)
ICPC Central Russia Regional Contest (CRRC 19)文章目录ICPC Central Russia Regional Contest (CRRC 19)A. Green teaB. Mysterious ResistorsC. EmoticonsD. Power playE. Printed circuit boardF. A word gameG. HourglassH. Men's showdownI. Andrew and PythonJ. Something原创 2021-03-01 17:16:22 · 1210 阅读 · 1 评论 -
Codeforces Round #657 (Div. 2)
文章目录Codeforces Round #657 (Div. 2)A. Acacius and StringB. Dubious CyrptoC. Choosing flowersCodeforces Round #657 (Div. 2)A. Acacius and String题意: 给定一个字符串,字符串是由小写字符和?构成,长度为n,n<=50。问往字符串里面填字符后,新的字符串包含“abacaba”作为子串,且该子串的出现次数唯一。题解: 因为n的长度非常小,那么我直接去枚举位置i原创 2021-02-26 22:53:59 · 56 阅读 · 0 评论 -
Codeforces Round #692
Codeforces Round #692B. Fair Numbers题意: 给定一个正整数n,要求找到一个大于等于n的最小的正整数x,使得x中的每一位都能整除n。题解: 数学。猜了个结论,直接暴力枚举,从当前n开始到n+lcm(1, ,2, …, 9),必然不大。代码:#include <bits/stdc++.h>#define int long longusing namespace std;inline int read() { int s = 0, w =原创 2021-02-25 11:38:42 · 228 阅读 · 0 评论 -
AtCoder Beginner Contest 192
文章目录AtCoder Beginner Contest 192D - Base nE - Train**F - Potion**AtCoder Beginner Contest 192D - Base n题意: 给出n,m,设n中最大的数字为x,问在不同的进制(bas>x)下,小于等于m的不同的数有多少个题解: 二分。 发现进制其实有单调性,进制越大,得到的值越大。那么我直接二分。然后需要特判下一位的情况。代码:#include <bits/stdc++.h>using原创 2021-02-25 00:05:16 · 181 阅读 · 0 评论 -
2020-2021 ACM-ICPC Brazil Subregional Programming Contest
文章目录2020-2021 ACM-ICPC Brazil Subregional Programming ContestA.Sticker AlbumB.BattleshipE.Party CompanyF.FastmintonG.Game Show!H.SBC's HangarL.LavasparN.Number Multiplication2020-2021 ACM-ICPC Brazil Subregional Programming ContestA.Sticker Album题意: 给你一原创 2021-02-24 22:26:57 · 948 阅读 · 0 评论 -
Educational Codeforces Round 100 (Rated for Div. 2)
文章目录Educational Codeforces Round 100 (Rated for Div. 2)A. DungeonB. Find The ArrayC. Busy RobotD. PairsEducational Codeforces Round 100 (Rated for Div. 2)A. Dungeon题意: 给你a、b、c三个数,你每次操作可以选择其中一个数减去1,每逢7的倍数次操作,三个数都减去1。问是否可以在某一轮三个数同时变成零。题解: 只需要判断hp的和十分为9的倍原创 2021-02-22 00:09:34 · 238 阅读 · 1 评论 -
Codeforces Round #629 (Div. 3)
文章目录Codeforces Round #629 (Div. 3)B. K-th Beautiful StringD. CarouselE. Tree QueriesF. Make k EqualCodeforces Round #629 (Div. 3)B. K-th Beautiful String题意: 给定一个长度n,一个次序m,定义一个特殊字符串s为:s中只含有a和b,且b的个数为2。现在要求大于长度为n的,次序为m的字符串。题解: 规律题。观察规律可以知道:bb ....原创 2021-02-21 22:19:30 · 89 阅读 · 0 评论 -
Codeforces Round #642 (Div. 3)
Codeforces Round #642 (Div. 3)D. Constructing the Array题意: 一个全零序列,每次操作选择最长靠左的子段[l,r],将a[(l+r)/2]赋值,然后分成2个子段,求最终序列。题解: 模拟。直接使用优先队列进行模拟。代码:#include <bits/stdc++.h>using namespace std;typedef long long LL;int const MAXN = 2e5 + 10;int n, m, T原创 2021-02-21 19:09:02 · 110 阅读 · 0 评论 -
Codeforces Round #650 (Div. 3)
文章目录Codeforces Round #650 (Div. 3)D. Task On The BoardE. Necklace AssemblyF1. Flying Sort (Easy Version)F2. Flying Sort (Hard Version)Codeforces Round #650 (Div. 3)D. Task On The Board题意: 给定一个字符串,要求从字符串内一些字符,使得这些字符重新排列,满足b数组。b数组为:b[i]为所有重新排列后的字符内比i字符大的字原创 2021-02-21 18:41:25 · 69 阅读 · 0 评论 -
Codeforces Round #698 (Div. 2)
文章目录Codeforces Round #698 (Div. 2)A. Nezzar and Colorful BallsB. Nezzar and Lucky NumberC. Nezzar and Symmetric ArrayD. Nezzar and BoardE. Nezzar and Binary StringF. Nezzar and Nice BeatmapCodeforces Round #698 (Div. 2)A. Nezzar and Colorful Balls题意: 给定原创 2021-02-20 18:35:37 · 115 阅读 · 0 评论 -
Educational Codeforces Round 104 (Rated for Div. 2)
文章目录Educational Codeforces Round 104 (Rated for Div. 2)A. ArenaB. Cat CycleC. Minimum TiesD. Pythagorean TriplesE. Cheap DinnerEducational Codeforces Round 104 (Rated for Div. 2)A. Arena题意: n个英雄,每个英雄有一个权值,权值大的能够赢权值小的,只要一个英雄能够赢一场,那么这个英雄就可以当赢家,问有多少个英雄不能当赢原创 2021-02-20 11:29:05 · 144 阅读 · 0 评论 -
Codeforces Round #702 (Div. 3)
文章目录Codeforces Round #702 (Div. 3)A. Dense ArrayB. Balanced RemaindersC. Sum of CubesD. Permutation TransformationE. Accidental VictoryF. Equalize the ArrayG. Old Floppy DriveCodeforces Round #702 (Div. 3)A. Dense Array题意:题解:代码:#include <bits/stdc原创 2021-02-20 11:16:52 · 80 阅读 · 0 评论