<div class="solution-view">
    <div class="row">
        <div class="col-md-6">
            <p>提交时间：2026-07-17 11:15:10</p>
        </div>
        <div class="col-md-6">
            <p>运行 ID: <a href="/solution/detail?id=92658">92658</a></p>
        </div>
    </div>
    <div class="pre"><p>#include &lt;bits/stdc++.h&gt;

#define int long long

using namespace std;

typedef long long ll;

const int N = 1000 + 5, mod = 998244353;

map&lt;char, int&gt; pty;

string a, tmp;

int n;

int p2[N], sum[N];

stack&lt;char&gt; s;

stack&lt;int&gt; s1;

void init(string &amp; y) {
    int l = 0, r = 0;
    for (int i = 0; i &lt; (int)y.size(); i++) {
        if (y[i] == &#039;(&#039;) {
            l++;
        } else if (y[i] == &#039;)&#039;) {
            r++;
        }
        if (l &lt; r) {
            y.erase(i);
            r--;
        }
    }
}

int qpow(int a, int b) {
	if (b == 0ll) {
		return 1ll;
	}
	if (b == 1ll) {
		return (ll)a;
	}
	int ans;
	if (b % 2ll) {
		ans = qpow(a, b / 2ll) % mod;
		ans = (ans % mod) * (ans % mod) % mod;
		ans = (ans % mod) * (a % mod) % mod;
	} else {
		ans = qpow(a, b / 2ll) % mod;
		ans = (ans % mod) * (ans % mod) % mod;
	}
	return ans;
}

int solve(string x, int y) {
    for (int i = 0; i &lt; (int)x.length(); i++) {
        if (x[i] == &#039; &#039;) continue;
        if (x[i] == &#039;a&#039;) {
            tmp += to_string(y) + &quot;.&quot;;
            continue;
        }
        if (x[i] &gt;= &#039;0&#039; &amp;&amp; x[i] &lt;= &#039;9&#039;) {
            while (i &lt; (int)x.length() &amp;&amp; x[i] &gt;= &#039;0&#039; &amp;&amp; x[i] &lt;= &#039;9&#039;) {
                tmp += x[i];
                i++;
            }
            i--;
            tmp += &quot;.&quot;;
            continue;
        } else {
            if (x[i] == &#039;(&#039;) {
                s.push(x[i]);
            } else if (x[i] == &#039;)&#039;) {
                while (!s.empty() &amp;&amp; s.top() != &#039;(&#039;) {
                    tmp += s.top();
                    s.pop();
                }
                s.pop();
            } else {
                while (!s.empty() &amp;&amp; pty[x[i]] &lt;= pty[s.top()]) {
                    tmp += s.top();
                    s.pop();
                }
                s.push(x[i]);
            }
        }
    }
    while (!s.empty()) {
        tmp += s.top();
        s.pop();
    }
    int p1 = 0ll;
    for (int i = 0; i &lt; (int)tmp.length(); i++) {
        if (tmp[i] &gt;= &#039;0&#039; &amp;&amp; tmp[i] &lt;= &#039;9&#039;) {
            while (tmp[i] != &#039;.&#039; &amp;&amp; tmp[i] &gt;= &#039;0&#039; &amp;&amp; tmp[i] &lt;= &#039;9&#039;) {
                p1 = (ll)((p1 &lt;&lt; 1ll) + (p1 &lt;&lt; 3ll) + (tmp[i] - 48ll));
                i++;
            }
            s1.push(p1);
            p1 = 0ll;
        } else if (tmp[i] != &#039;.&#039;) {
            int a = s1.top();
            s1.pop();
            int b = s1.top();
            s1.pop();
            if (tmp[i] == &#039;+&#039;) {
                s1.push((((ll)b + (ll)a) % mod + mod) % mod);
            } else if (tmp[i] == &#039;-&#039;) {
                s1.push(((ll)b - (ll)a + mod) % mod);
            } else if (tmp[i] == &#039;*&#039;) {
                s1.push(((ll)b * (ll)a % mod + mod) % mod);
            } else if (tmp[i] == &#039;^&#039;) {
                s1.push((qpow((ll)b, (ll)a) + mod) % mod);
            }
        }
    }
    int ans = s1.top() % mod;
    s1.pop();
    return ans % mod;
}

signed main() {
    pty[&#039;(&#039;] = -100;
    pty[&#039;+&#039;] = pty[&#039;-&#039;] = 1;
    pty[&#039;*&#039;] = pty[&#039;/&#039;] = 2;
    pty[&#039;^&#039;] = 3;
    char c = getchar();
    while (c != &#039;\n&#039; &amp;&amp; c != &#039;\r&#039;) {
        a += c;
        c = getchar();
    }
    init(a);
    for (int i = 1; i &lt;= 10; i++) {
        p2[i] = solve(a, (ll)i) % mod;
    }
    cin &gt;&gt; n;
    string res = &quot;&quot;;
    getchar();
    for (int i = 1; i &lt;= n; i++) {
        string str = &quot;&quot;;
        c = getchar();
        while (c == &#039;\n&#039; || c == &#039;\r&#039;) {
            c = getchar();
        }
        while (c != &#039;\n&#039; &amp;&amp; c != &#039;\r&#039;) {
            str += c;
            c = getchar();
        }
        init(str);
        for (int j = 1; j &lt;= 10; j++) {
            sum[j] = solve(str, (ll)j) % mod;
        }
        bool flag = true;
        for (int j = 1; j &lt;= 10; j++) {
            if (p2[j] != sum[j]) {
                flag = false;
                break;
            }
        }
        if (flag) {
            res += &#039;A&#039; + i - 1;
        }
    }
    cout &lt;&lt; res;
    return 0;
}
</p></div>
</div>
<script type="text/javascript">
    (function ($) {
        $(document).ready(function () {
            $('.pre p').each(function(i, block) {  // use <pre><p>
                hljs.highlightBlock(block);
            });
        })
    })(jQuery);
</script>