B - String LCM

最新推荐文章于 2024-02-28 16:09:37 发布

a_aron_

最新推荐文章于 2024-02-28 16:09:37 发布

阅读量401

点赞数

分类专栏： 21寒假补题

本文链接：https://blog.csdn.net/a_aron_/article/details/112991734

版权

字符串操作整数倍循环节最小公倍串 LCM

关键词由CSDN通过智能技术生成

21寒假补题专栏收录该内容

3 篇文章 0 订阅

订阅专栏

B - String LCM

题目
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.
Input

3
baba
ba
aa
aaa
aba
ab

output

baba
aaaaaa
-1

Note

In the first test case, “baba” = “baba” ⋅ 1 = “ba” ⋅ 2.
In the second test case, “aaaaaa” = “aa” ⋅ 3 = “aaa” ⋅ 2.

题目描述：给定两个字符串，求一个字符串（要求该字符串同时是给定两个字符串的整数倍，也就是重复的）若无，则返回-1；

思路：分别求给定的两个字符串的最小的循环节，和分别有几个最小循环节s1,t1，若循环节相同，则重复输出lcm（s1,t1）,否则-1；

#include<stdio.h>
#include<string>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn = 1e5+5; 
int ss,tt;
char s[25],t[25];
int gcd(int x, int y)
{
	return y > 0 ? gcd(y,x%y) : x;
}
bool ii(int m) {
    if(ss % m != 0) return false;
    for(int i = 0;i < ss;i++) {
        if(s[i] != s[i % m]) return false;
    }
    return true;
}
bool ff(int m) {
    if(tt % m != 0) return false;
    for(int i = 0;i < tt;i++) {
        if(t[i] != t[i % m]) return false;
    }
    return true;
}
int main()
{
	int q,flag;
	scanf("%d",&q);
	while(q--)
	{
		scanf("%s %s",s,t);
		flag = 1;
		int s1,t1;
		ss=strlen(s),tt=strlen(t);
		for(int i = 1;i <= ss;i++)
		{
            if(ii(i)) 
			{
                s1 = i;
				break;
            }
        }
        for(int i = 1;i <= tt;i++) 
		{
            if(ff(i)) 
			{
                t1 = i;
				break;
            }
        }
        if(t1!=s1) flag = 0;
        else {
        	for(int i = 0; i < t1; i++)
        	{
        		if(s[i]!=t[i]) 
        		{
        			flag = 0;
        			break;
				}
			}
		}
		if(!flag) printf("-1\n");
		else{
			ss=ss/s1;
			tt=tt/t1;
			int lcm = (ss*tt)/gcd(ss,tt);
			for(int i = 0; i < lcm;i++)
			{
				for(int j = 0; j < s1; j++)
				{
					printf("%c",s[j]);
				}	
			}
			printf("\n");
		} 
	}
	return 0;
 }