Codedigger Training Contest -String

8 problems from Codedigger Training Contest -String (contest 102766), difficulty -. 7/8 solutions verified against sample I/O.

8 items

Codedigger Training Contest -String

Special | 8 problems | 7/8 verified | Difficulty - | 9m 29s

#	Problem	Time	✓
A	Singhal and Swap	1m 4s	✓
B	Singhal and Equality	1m 18s	✓
C	Regular Bracket Sequence	1m 24s	✓
D	Regular Bracket Sequence Again?	56s	✓
E	Singhal and Missing Number	1m 14s	✓
F	Singhal and Broken Keyboard (easy version)	1m 15s	✓
G	Singhal and Broken Keyboard (hard version)	1m 19s	✓
H	Singhal and String	59s

Practice › Codeforces Solutions › Codedigger Training Contest -String ›

CF 102766H - Singhal and String

I can write the full editorial, but the problem statement for Codeforces 102766H - Singhal and String is missing from the prompt. I cannot reliably reconstruct the algorithm, edge cases, examples, or implementation without knowing the actual task.

Practice › Codeforces Solutions › Codedigger Training Contest -String ›

CF 102766B - Singhal and Equality

The string contains lowercase letters, and the goal is to modify it until every letter that appears has exactly the same frequency. One operation changes one existing character into any other lowercase character. The task is to find the smallest number of such changes needed.

Practice › Codeforces Solutions › Codedigger Training Contest -String ›

CF 102766G - Singhal and Broken Keyboard (hard version)

The keyboard contains only two keys, a and b. Pressing a key does not print one character. Instead, every pressed character becomes a block of two or three copies of that character. The input string describes the order of key presses.

Practice › Codeforces Solutions › Codedigger Training Contest -String ›

CF 102766A - Singhal and Swap

The problem gives two lowercase strings, S and T. An operation chooses one position from S and one position from T and exchanges the characters at those positions. The operation can be repeated any number of times.

Practice › Codeforces Solutions › Codedigger Training Contest -String ›

CF 102766F - Singhal and Broken Keyboard (easy version)

We have a keyboard with only two possible keys, a and b. When a key is pressed, the keyboard does not print the character once. Instead, it prints either two copies or three copies of that character.

Practice › Codeforces Solutions › Codedigger Training Contest -String ›

CF 102766E - Singhal and Missing Number

We are given a string that was created by writing several consecutive integers next to each other. The integers originally formed a range from some starting value n to an ending value m, with at least three numbers in the range.

Practice › Codeforces Solutions › Codedigger Training Contest -String ›

CF 102766D - Regular Bracket Sequence Again?

We have exactly N opening brackets and N closing brackets, so every valid answer is a regular bracket sequence of length 2N. Among all such sequences, we need to count only the ones that cannot be obtained by taking some string of length N and writing it twice consecutively.

Practice › Codeforces Solutions › Codedigger Training Contest -String ›

CF 102766C - Regular Bracket Sequence

We are given a string made only of opening brackets ( and closing brackets ). We want to transform it into a regular bracket sequence.