![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codefocees
karlkhyang
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #565 div 3
Codeforces Round #565 div 3A. Divide it!B. Merge it!C. Lose it!D. Recover it!E. Cover it!A. Divide it!题意:给定一个数字n,每一次可以对n进行下面三种操作之一若n可以整除2,n = n/2若n可以整除3,n = 2/3*n若n可以整除5,n = 4/5*n输出从n得到1的 最小次...原创 2019-06-13 18:46:47 · 260 阅读 · 0 评论 -
Educational Codeforces Round 66 Rated for Div. 2(部分题目)
Educational Codeforces Round 66 Rated for Div. 2A. From Hero to ZeroB. Catch Overflow!C. ElectrificationD. Array SplittingA. From Hero to Zero题意:给定一个n和一个k,通过以下操作将n转换为0n=n-1若n可以整除k,n = n/2输出从n转...原创 2019-06-16 22:21:25 · 207 阅读 · 0 评论 -
Codeforces Round #566 div 2
Codeforces Round #566 div 2A Filling ShapesB Plus from PictureC Beautiful LyricsD Complete MirrorE Product Oriented RecurrenceF Maximum SineA.Filling Shapes题意:用多个2x1的木块通过不同的组合方式构成一个3xn的...原创 2019-06-17 11:16:56 · 169 阅读 · 0 评论 -
Codeforces Round #568 div 2 (A-F题解)
Codeforces Round #568 div 2 (A-F)A. RopewalkersB. Email from PolycarpC1.Exam in BerSU (easy version)C2. Exam in BerSU (hard version)D. Extra ElementE. Polycarp and SnakesF. Two PizzasA. Ropewalkers题...原创 2019-06-25 20:46:17 · 343 阅读 · 0 评论 -
Codeforces Round #563 (Div. 2)
Codeforces Round #563 Div. 2A Ehab Fails to Be ThanosB. Ehab Is an Odd PersonC.Ehab and a Special Coloring ProblemD. Ehab and the Expected XOR ProblemA Ehab Fails to Be Thanos题意:给2n个数字,问有没有一种排列使得前n个...原创 2019-06-22 20:17:06 · 199 阅读 · 0 评论 -
Codeforces Round #567 div 2
Codeforces Round #567 div 2A. Chunga-ChangaB.Split a NumberC. FlagA. Chunga-Changa题意:两个人去买椰子,给定他们两人持有的钱数,计算两人可以购买的椰子数量的最大值,并且计算其中一人要给另外一个人的钱数至少是多少。思路:对于这道题,可以首先计算出两个人分别能够购买的最大椰子数目,并且算出两个人分别剩下的钱,并...原创 2019-06-22 20:26:20 · 329 阅读 · 0 评论 -
Codeforces Round #564 div 2部分题解
Codeforces Round #564 div 2A. Nauuo and VotesB. Nauuo and ChessC. Nauuo and CardsD. Nauuo and CircleA. Nauuo and Votes题意:给你三个数,分别是赞成的,不赞成的,和未知的。如果一定会赞成输出+,一定的反对输出-,一定票数相等输出0,否则输出?。思路:如果赞成的大于反对的和未...原创 2019-06-22 20:37:33 · 135 阅读 · 0 评论