J - String LCM

最新推荐文章于 2024-09-29 18:03:50 发布

wky的代码小仓库

最新推荐文章于 2024-09-29 18:03:50 发布

阅读量195

点赞数

分类专栏：蓝桥杯训练—枚举文章标签： c++

本文链接：https://blog.csdn.net/weixin_55248863/article/details/122832941

版权

蓝桥杯训练—枚举专栏收录该内容

2 篇文章 0 订阅

订阅专栏

这篇博客讨论了一个字符串乘法的概念，其中两个字符串可以通过重复某个字符串来相互转换。定义了字符串的除法规则，并介绍了如何找到两个字符串的最短非空公共倍数（LCM）。博主通过示例解释了算法并提供了代码实现，展示了如何在给定限制下找出字符串的LCM或报告其不存在的情况。

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

J - String LCM

Let's define a multiplication operation between a string aa and a positive integer xx: a \cdot xa⋅x is the string that is a result of writing xx copies of aa one after another. For example, "abc" \cdot~2~=⋅ 2 = "abcabc", "a" \cdot~5~=⋅ 5 = "aaaaa".

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

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

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

Input

The first line contains one integer qq (1 \le q \le 20001≤q≤2000) — the number of test cases.

Each test case consists of two lines, containing strings ss and tt (1 \le |s|, |t| \le 201≤∣s∣,∣t∣≤20). Each character in each of these strings is either 'a' or 'b'.

Output

For each test case, print LCM(s, t)LCM(s,t) if it exists; otherwise, print -1. It can be shown that if LCM(s, t)LCM(s,t) exists, it is unique.

Sample 1

Inputcopy	Outputcopy
3 baba ba aa aaa aba ab	baba aaaaaa -1

Note

In the first test case, "baba" = "baba" \cdot~1~=⋅ 1 = "ba" \cdot~2⋅ 2.

In the second test case, "aaaaaa" = "aa" \cdot~3~=⋅ 3 = "aaa" \cdot~2⋅ 2.

#include<bits/stdc++.h>
using namespace std;
#define M 1000000
const int N=2e6+1;
int a[N];
int def(int m,int n)
{
    for(int i=m;;i=i+m){
        for(int j=n;j<=i;j=j+n){
            if(i==j){
                return i;
            }
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int q;
    string s,t;
    cin>>q;
    for(int i=0;i<q;i++){
        cin>>s>>t;
        int m;
        m=def(s.size(),t.size());
        string f=s,g=t;
        for(int j=s.size();j<m;j+=s.size()){
            f+=s;
        }
        for(int j=t.size();j<m;j+=t.size()){
            g+=t;
        }
        if(f==g) cout<<f<<endl;
        else cout<<-1<<endl;
    }
    return 0;
}