90pts求调

#include <iostream>
#include <algorithm>
#include <cstring>
#define Please return
#define AC 0
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
using namespace std;
using ll = unsigned long long;
const int MAXN = 1e6 + 5;
ll t, n, x;
string op;

struct Stack {
	ll s[MAXN];
	ll Top;
	Stack() {
		memset(s, 0, sizeof(s));
		Top = 0;
	}
	void push(ll x) {
		s[++Top] = x;
	}
	void pop() {
		if (Top == 0) {
			cout << "Empty" << endl;
		} else {
			Top--;
		}
	}
	void top() {
		if (Top == 0) {
			cout << "Anguei!" << endl;
		} else {
			cout << s[Top] << endl;
		}
	}
	void size() {
		cout << Top << endl;
	}
};
Stack st;

int main() {
	cin >> t;
	while (t--) {
		cin >> n;
		for (ll i = 1; i <= n; i++) {
			cin >> op;
			if (op == "push") {
				cin >> x;
				st.push(x);
			} else if (op == "pop") {
				st.pop();
			} else if (op == "query") {
				st.top();
			} else {
				st.size();
			}
		}
	}
	Please AC;
}