相关阅读
相关 Educational Codeforces Round 90 (Rated for Div. 2) B 01 Game
[Problem - 1373B - Codeforces][] 题意： 给定一个01字符串，两个人玩游戏，一方可以去掉两个不同的相邻元素，不能取的人失败，问胜方是谁 思
ゞ 浴缸里的玫瑰相关 Educational Codeforces Round 154 (Rated for Div. 2)
[Dashboard - Educational Codeforces Round 154 (Rated for Div. 2) - Codeforces
爱被打了一巴掌相关 Educational Codeforces Round 59 (Rated for Div. 2)(ABCD)
A. Digits Sequence Dividing 题意：给你一个数字串，只包含1-9，让你至少分成两段，使得每一段的数字大于前一段的数字； 解：对n特判，如果n为2，
港控/mmm°相关 Educational Codeforces Round 71 (Rated for Div. 2)
Educational Codeforces Round 71 (Rated for Div. 2) [比赛链接][Link 1] C. Gas Pipel
骑猪看日落相关 Educational Codeforces Round 59 [Rated for Div. 2] B. Digital root
Today at the lesson of mathematics, Petya learns about the digital root. The digital ro
r囧r小猫相关 Educational Codeforces Round 63 (Rated for Div. 2) (A,B,C)
这次比赛很顺利的出了3个题，rating上涨了98，菜菜的我后面的不会了。 [A - Reverse a Substring][] include<bits/std
相关 Educational Codeforces Round 66 (Rated for Div. 2) Minimal Segment Cover
题意：给你n个区间，m个询问，对于每个询问求最少可以用多少个区间完成覆盖，区间可以重叠。 思路：倍增法，f\[i\]\[j\]表示i点连续向后扩展2^j个区间后可以达到的
相关 Educational Codeforces Round 65 (Rated for Div. 2) D. Bicolored RBS
链接：[https://codeforces.com/contest/1167/problem/D][https_codeforces.com_contest_1167_pr
相关 Educational Codeforces Round 68 (Rated for Div. 2) A B C
A[Remove a Progression][] include<bits/stdc++.h> using namespace std; defin
相关 Educational Codeforces Round 69 (Rated for Div. 2) D
题目大意: 给出一个序列,和\\(m,k\\),求\\(\\sum\_\{i=l\}^\{r\}\{a\_i\}-k\\left \\lceil \\frac\{
还没有评论，来说两句吧...