func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MOD = 1073741824;   const int N = 200005;   const double PI = 4 * atan(1);   set<char> vowel = { A ,  O ,  Y ,  E ,  U ,  I ,  a ,  o ,  e ,  u ,  y ,  i };   int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};   int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};   long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }   long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }   bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }   bool isprime(long long u) {     for (long long i = 2; i <= (int)sqrt(u); i++) {       if (u % i == 0) return 0;     }     return 1;   }   long long mod(long long to_mod) {     to_mod %= MOD;     while (to_mod < 0) to_mod += MOD;     return to_mod % MOD;   }   long long moduloMultiplication(long long a, long long b, long long mod) {     long long res = 0;     a %= mod;     while (b) {       if (b & 1) res = (res + a) % mod;       a = (2 * a) % mod;       b >>= 1;     }     return res;   }   long long power(long long x, long long y) {     long long res = 1;     x = x;     while (y > 0) {       if (y & 1) res = (res * x);       y = y >> 1;       x = (x * x);     }     return res;   }   long long n, m, k, q, res, x, y, ans;   string ch, sh, d;   bool ok(string ss, long long len) {     string second =   ;     for (int i = 1; i <= max(n / len, m / len); i++) {       second += ss;       if (i == n / len) {         if (ch != second) return 0;       }       if (i == m / len) {         if (sh != second) return 0;       }     }     return 1;   }   int main() {     cin >> ch;     cin >> sh;     n = ch.size();     m = sh.size();     k = min(n, m);     long long i = 0;     d =   ;     ans = 0;     x = 0;     while (i < k && ch[i] == sh[i]) {       d += ch[i];       x++;       if (n % x == 0 && m % x == 0) {         if (ok(d, x)) ans++;       }       i++;     }     cout << ans;     return 0;   }   