This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

Kvant 2023, M2745
Tags: combinatorics , binary sequences
Two 100-digit binary sequences are given. In one operation, one may insert (possibly at the beggining or end) or remove one or more identical digits from a sequence. What is the smallest $k{}$ for which we can transform the first sequence into the second one in no more than $k{}$ operations? [i]Proposed by V. Novikov[/i]