Problem C, Codeforces Round 913 (Div. 3)

Revision en1, by lucius_fox, 2023-12-06 18:10:04

In C, how do you prove that if no character appears more than floor(n/2) times, we can always achieve n%2 length of the final string? (where 'n' is the length of the given string) Please help.

Tags help, proof, problem


  Rev. Lang. By When Δ Comment
en1 English lucius_fox 2023-12-06 18:10:04 232 Initial revision (published)