<p>For two strings <code>s</code> and <code>t</code>, we say &quot;<code>t</code> divides <code>s</code>&quot; if and only if <code>s = t + t + t + ... + t + t</code> (i.e., <code>t</code> is concatenated with itself one or more times).</p>

<p>Given two strings <code>str1</code> and <code>str2</code>, return <em>the largest string </em><code>x</code><em> such that </em><code>x</code><em> divides both </em><code>str1</code><em> and </em><code>str2</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> str1 = &quot;ABCABC&quot;, str2 = &quot;ABC&quot;
<strong>Output:</strong> &quot;ABC&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> str1 = &quot;ABABAB&quot;, str2 = &quot;ABAB&quot;
<strong>Output:</strong> &quot;AB&quot;
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> str1 = &quot;LEET&quot;, str2 = &quot;CODE&quot;
<strong>Output:</strong> &quot;&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= str1.length, str2.length &lt;= 1000</code></li>
	<li><code>str1</code> and <code>str2</code> consist of English uppercase letters.</li>
</ul>

class Solution {
public:
    string gcdOfStrings(string str1, string str2) {

        string GCD = "";


        string tempGCD = "";

        for (int i = 0; i < (str1.length()); i++){


            
            tempGCD += str1[i];

            bool gcdStrBool = true;
            if (str1.length() % (i + 1) == 0){

                if (str2.length() % (i + 1) == 0){

                    string compStr = "";
                    for (int k = 0; k < str1.length() / (i + 1); k++){
                        compStr += tempGCD;
                    }
                    if (str1 != compStr){
                        gcdStrBool = false;
                        continue;
                    }

                    compStr = "";
                    for (int k = 0; k < str2.length() / (i + 1); k++){
                        compStr += tempGCD;
                    }



                    if (str2 != compStr){
                        gcdStrBool = false;
                        continue;
                    }


                }
                else {
                    gcdStrBool = false;
                }

            }
            else {
                gcdStrBool = false;
            }



            if (gcdStrBool){
                GCD = tempGCD;
            }


        }







        return GCD;

        
    }
};
10738