-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
79 lines (71 loc) · 1.46 KB
/
Copy pathB.cpp
File metadata and controls
79 lines (71 loc) · 1.46 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<bits/stdc++.h>
using namespace std;
long long gcd(long long int a, long long int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
// Function to return LCM of two numbers
long long lcm(int a, int b)
{
return (a / gcd(a, b)) * b;
}
int main()
{
int t;
string s1,s2;
cin>>t;
//cout<<boost::math::lcm(10,20);
while(t--)
{
cin>>s1>>s2;
if(s1==s2)
{
cout<<s1;
}
else if(s1.length()==s2.length() && s2!=s1)
{
cout<<-1;
}
else
{
string s3,s4;
if(s1.length()>s2.length())
{
s3=s2;
s4=s1;
}
else
{
s3=s1;
s4=s2;
}
string s5=s4.substr(0,s3.length());
if(s5!=s3)
{
cout<<-1;
}
else
{
int x=lcm(s3.length(),s4.length());
int y=x;
y=y/s3.length();
x=x/s4.length();
s5="";
for(int i=0;i<x;i++)
s5+=s4;
string s6;
for(int i=0;i<y;i++)
s6+=s3;
if(s5==s6)
cout<<s6;
else
{
cout<<-1;
}
}
}
cout<<endl;
}
}