逆向操作堆栈

#include<iostream>
#include<stack>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long LL;
const int maxn = (int)1e5 + 7;
LL A[maxn];
LL Q[maxn][5];
LL gcd(LL x, LL y)
{
    while (y) {
        LL r = x % y;
        x = y;
        y = r;
    }
    return x;
}
int main() 
{
    int T;
    cin >> T;
    while (T--)
    {
        int n;
        cin >> n;
        for (int i = 1; i <= n; i++)
        {
            scanf("%I64d", A + i);
        }
        int q;
        cin >> q;
        for (int i = 1; i <= q; i++)
        {
            scanf("%I64d%I64d%I64d%I64d", &Q[i][0], &Q[i][1], &Q[i][2], &Q[i][3]);
        }
        for (int i = 1; i <= n; i++)
        {
            stack<LL> st;
            int t = q;
            while (t)
            {
                if (Q[t][1] <= i&&Q[t][2] >= i)
                {
                    if (Q[t][0] == 1)
                    {
                        A[i] = Q[t][3];
                        break;
                    }
                    else
                    {
                        st.push(Q[t][3]);
                    }
                }
                t--;
            }
            while (!st.empty())
            {
                LL x = st.top();
                st.pop();
                if(A[i]>x)
                A[i] = gcd(A[i], x);
            }
        }
        for (int i = 1; i <= n; i++)
        {
            printf("%I64d ", A[i]);
        }
        cout << endl;
    }
    return 0;
}