Submission #3588666

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>

typedef long long ll;

int gcd_(int a, int b) {
	if(b == 0) return a;
	return gcd_(b, a % b);
}

int main() {
	int n, m;
	std::string s1, s2;
	std::cin >> n >> m;
	std::cin >> s1 >> s2;
	int gcd = gcd_(n, m);
	ll ans =  1ll * n * m / gcd;
	int adn = n / gcd, adm = m / gcd;
	for(int i = 1, j = 1; i <= n && j <= m; i += adn, j += adm) {
		if(s1[i - 1] != s2[j - 1]) 
			ans = -1;
	}
	std::cout << ans << '\n';
	return 0;
}

Submission Info

Judge Result