CodeForces - 1473B

最新推荐文章于 2024-01-07 12:21:21 发布

buzzaz

最新推荐文章于 2024-01-07 12:21:21 发布

阅读量137

点赞数

本文链接：https://blog.csdn.net/buzzaz/article/details/115308195

版权

该博客讨论了一种特定的字符串处理问题，即寻找两个只包含'a'和'b'字符的字符串之间的最小公倍序列（LCM）。题目要求在不超过20个字符的情况下找到这两个字符串的LCM，如果存在则输出，否则输出-1。提供的解决方案通过比较两个字符串长度并填充较短的字符串以达到相同长度，然后检查是否相等来确定LCM。如果字符串长度增大，这种暴力方法可能不再适用。

摘要由CSDN通过智能技术生成

CodeForces - 1473B

题目

Let’s define a multiplication operation between a string a and a positive integer x: a⋅x is the string that is a result of writing x copies of a one after another. For example, “abc” ⋅ 2 = “abcabc”, “a” ⋅ 5 = “aaaaa”.

A string a is divisible by another string b if there exists an integer x such that b⋅x=a. For example, “abababab” is divisible by “ab”, but is not divisible by “ababab” or “aa”.

LCM of two strings s and t (defined as LCM(s,t)) is the shortest non-empty string that is divisible by both s and t.

You are given two strings s and t. Find LCM(s,t) or report that it does not exist. It can be shown that if LCM(s,t) exists, it is unique.

Input
The first line contains one integer q (1≤q≤2000) — the number of test cases.

Each test case consists of two lines, containing strings s and t (1≤|s|,|t|≤20). Each character in each of these strings is either ‘a’ or ‘b’.

Output
For each test case, print LCM(s,t) if it exists; otherwise, print -1. It can be shown that if LCM(s,t) exists, it is unique.
Example
inputCopy
3
baba
ba
aa
aaa
aba
ab
outputCopy
baba
aaaaaa
-1
No