M - String LCM（LCM字符串）

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

A string aa is divisible by another string bb if there exists an integer xx such that b⋅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≤q≤20001≤q≤2000) — the number of test cases.

Each test case consists of two lines, containing strings ss and tt (1≤|s|,|t|≤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.

Example
Input
3
baba
ba
aa
aaa
aba
ab
Output
baba
aaaaaa
-1
Note
In the first test case, “baba” = “baba” ⋅ 1 =⋅ 1 = “ba” ⋅ 2⋅ 2.

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

#include<bits/stdc++.h>
using namespace std; 
int main()
{
	int i,t,x,y,s,c,f,d,v,n;
	char a[100],b[100];
	scanf("%d",&n);
	getchar();
	while(n--)
	{
		gets(a);
		gets(b);
		x=strlen(a);
		y=strlen(b);
		s=x;f=y;
		if(x<y)
		{
			t=x;
			x=y;
			y=t;
		}
		c=x%y;
		while(c!=0)
		{
			x=y;
			y=c;
			c=x%y;
		}
		d=y;
		v=s/d*f;//求最小公倍数 
		int k=0;
		for(i=0;i<v;i++)
		{
			if(a[i%s]!=b[i%f])
			{
				k=1;
				break;
			}
		} 
		if(k)
		printf("-1\n");
		else
		{
			for(i=0;i<v;i++)
			printf("%c",a[i%s]);
			printf("\n");
		}
	}
	return 0;
}