func_code_string: #include <bits/stdc++.h>   void err() { std::cout << std::endl; }   template <typename T, typename... Args>   void err(T a, Args... args) {     std::cout << a <<    ;     err(args...);   }   template <template <typename...> class T, typename t, typename... A>   void err(const T<t> &arg, const A &...args) {     for (auto &v : arg) std::cout << v <<    ;     err(args...);   }   using namespace std;   const int N = 1e5 + 5;   void run() {     string s, t;     cin >> s >> t;     int n = s.length(), m = t.length();     vector<int> nxt(n, -1);     for (int i = 0; i < n; i++)       if (s[i] !=  . ) {         int t = 0;         for (int j = i; j < n; j++) {           if (s[j] !=  . )             ++t;           else             --t;           if (t == 0) {             nxt[i] = j;             break;           }         }       }     vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0x3f3f3f3f));     dp[0][0] = 0;     for (int i = 0; i < n; i++) {       for (int j = 0; j <= m; j++) {         if (j < m && s[i] == t[j]) {           dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j]);         }         dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1);         if (s[i] !=  .  && nxt[i] != -1) {           dp[nxt[i] + 1][j] = min(dp[nxt[i] + 1][j], dp[i][j]);         }       }     }     cout << dp[n][m] <<   n ;   }   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     cout << fixed << setprecision(20);     run();     return 0;   }   