## Educational Codeforces Round 116 (Rated for Div. 2) problem solving Report

A - AB Balance
meaning of the title
Give a string \ (s \) only composed of characters \ (a \) and \ (b \), and find the least modification to make the occurrence times of \ (ab \) in \ (s \) equal to that of \ (ba \).
thinking
\In (s \), both \ (ab \) and \ (ba \) only appear between consecutive segments and appear alternately, so the maximum d ...

Posted on *Sun, 05 Dec 2021 21:10:30 -0500* by **thallium6**

## Codeworks round 757 (Div. 2) problem solving Report

Portal
C
o
d
e
f
o
r
c
e
s
R
...

Posted on *Sun, 28 Nov 2021 01:03:12 -0500* by **andrewb**

## Codeforces Round #744 (Div. 3) problem solution complete A~G

Codeforces Round #744 (Div. 3)
A. Casimir's String Solitaire
meaning of the title
Give A string consisting only of characters' A ',' B 'and' C '. You can eliminate one' A 'and one' B 'at A time, or one' B 'and one' C 'at the same time. Ask whether all characters can be eliminated in the end.
thinking
It can be completely eliminated as long ...

Posted on *Thu, 14 Oct 2021 15:48:13 -0400* by **m00gzilla**

## Codeforces Round #744 (Div. 3)

A. Casimir's String Solitaire
meaning of the title Give you a string. You can delete AB or BC. Ask if you can delete the string and make it empty. Problem solving ideas Check in, judge
c
n
t
...

Posted on *Wed, 06 Oct 2021 21:35:27 -0400* by **scristaldi**

## 1400-1348B，698A，515C；Codeforces Round #745 (Div. 2)

Today is 2021.9.23, brushing two 1400 in the afternoon, div2 in the evening, and one after that.
1348.B. Phoenix and Beauty (construction)
General idea:
Construct a sequence such that the elements of a subsequence of length k in the sequence always sum to m.
Reflection:
If the sum of all the elements of a subsequence with length k in the ...

Posted on *Thu, 30 Sep 2021 12:00:43 -0400* by **kbdrand**

## Codeforces Global Round 16(A - E)

A. Median Maximization
The simple greedy construction question is intended to find the maximum median. If all the numbers in the known sequence are non negative, we can make all the numbers before the median zero, and then the median can get the maximum total divided by the remaining numbers and rounded down code
#include <bits/stdc++.h> ...

Posted on *Mon, 13 Sep 2021 22:50:12 -0400* by **zerogreen**

## Codeforces Global Round 16 Questions

E. Buds Re-hanging
Topic:
Given a multifork tree, a node is defined as a "tree bud". The condition is:
Not root nodeContains at least one child nodeAll child nodes are leaf nodes.
Now you can do one thing: graft the bud node and all its children onto another node.
Question: If you can do any of the above operations, what is the m ...

Posted on *Mon, 13 Sep 2021 13:52:32 -0400* by **nec9716**