#include using namespace std; using lint = long long int; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define POW2(n) (1LL << (n)) #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector &vec, int len) { vec.resize(len); } template void ndarray(vector &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template pair operator+(const pair &l, const pair &r) { return make_pair(l.first + r.first, l.second + r.second); } template pair operator-(const pair &l, const pair &r) { return make_pair(l.first - r.first, l.second - r.second); } template istream &operator>>(istream &is, vector &vec){ for (auto &v : vec) is >> v; return is; } ///// This part below is only for debug, not used ///// template ostream &operator<<(ostream &os, const vector &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template ostream &operator<<(ostream &os, const deque &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; } template ostream &operator<<(ostream &os, const set &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_set &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const multiset &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_multiset &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const pair &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; } template ostream &operator<<(ostream &os, const map &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_map &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; ///// END ///// /* #include #include #include using namespace __gnu_pbds; // find_by_order(), order_of_key() template using pbds_set = tree, rb_tree_tag, tree_order_statistics_node_update>; template using pbds_map = tree, rb_tree_tag, tree_order_statistics_node_update>; */ vector seikei(string S) { int N = S.length(); vector ret; REP(i, N) { if (i < N - 1) { if (S[i + 1] == '*') ret.emplace_back(S[i] + 100), i++; else if (S[i + 1] == '?') ret.emplace_back(S[i] + 2000), i++; else ret.emplace_back(S[i]); } else ret.emplace_back(S[i]); } return ret; } bool erasable(int c) { return c >= 'a' + 60; } int main() { string AS, BS; cin >> AS >> BS; vector A = seikei(AS); vector B = seikei(BS); vector> dp; int N = A.size(), M = B.size(); ndarray(dp, N + 1, M + 1); REP(i, N + 1) { REP(j, M + 1) { dp[i][j] = 1e7; } } dp[0][0] = 0; REP(i, N + 1) { REP(j, M + 1) { if (i < N) { mmin(dp[i + 1][j], dp[i][j] + !erasable(A[i])); } if (j < M) { mmin(dp[i][j + 1], dp[i][j] + !erasable(B[j])); } if (i < N and j < M) { mmin(dp[i + 1][j + 1], dp[i][j] + abs(A[i] - B[j]) % 100); if (A[i] - B[j] == -100) mmin(dp[i + 1][j], dp[i][j]); if (A[i] - B[j] == 100) mmin(dp[i][j + 1], dp[i][j]); } } } cout << dp[N][M] << endl; }