栈版题解

#include<stack>
#include<iostream>
#include<vector>
using namespace std;

int main(){
    stack<vector<int>> reversed;
    int n,m;
    cin>>n>>m;
    while(n--){
        int x=m;
        vector<int> inserted;
        while(x--){
            int obj;
            cin>>obj;
            inserted.push_back(obj);
        }
        reversed.push(inserted);
    }
    while(!reversed.empty()){
        for (int i:reversed.top())
            cout<<i<<' ';
        cout<<endl;
        reversed.pop();
    }
    return 0;
}