M - String LCM

M - String LCM

Problem Description
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
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.

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,x,y,s,c,t,f,d,v,i;
	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;
}

去QQ发一下这个头文件 你会发现宝藏哈哈哈哈哈！！！