cho.shresearchmini
ProblemCode
Description
Time limit
Memory limit
Each gear piece is represented by a string made of 1 and 2. A 1 is a groove, and a 2 is a protruding tooth.
Place the two gear pieces in the same direction. You may slide one piece left or right before meshing them. If both pieces have 2 at an overlapping position, two teeth collide, so that placement is invalid. Every other overlap is allowed.
Find the minimum horizontal width that can contain both gear pieces when they are placed without any collision.
The first line contains the string representing the first gear piece.
The second line contains the string representing the second gear piece.
Each string consists only of 1 and 2, and each length is at most 100.
Print the minimum possible horizontal width when the two gear pieces are placed without collision.