字符串反转，栈模拟(ZOJ1151)

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>

using namespace std;

int main()
{
    int n;
    cin >> n;
    while (n--)
    {
        int t,j=1;
        char k;
        cin >> t;
        getchar();
        while (1)
        {
            if (j > t)
                break;
            string p;
            cin >> p;
            reverse(p.begin(), p.end());
            cout << p;
            k = getchar();
            if (k ==‘ ‘)
                cout <<" ";
            if (k == ‘\n‘)
            {
                j++;
                cout << endl;
            }
        }
        if (n)
            cout << endl;
    }
    return 0;
}