两个队列模拟一个堆栈

#include  < iostream >
#include  < queue >
using   namespace  std;

int  main()
... {
    char c=0;
    queue<char> q1,q2;
    while(c=getchar(),c!='#')...{
        if('<'!=c)...{
            if(q1.empty())q2.push(c);
            else q1.push(c);
        }
        else...{
            if(q1.empty() && !q2.empty())...{
                while(1<q2.size())...{
                    q1.push(q2.front());
                    q2.pop();
                }
                cout<<q2.front()<<endl;
                q2.pop();
            }
            else if(q2.empty() && !q1.empty())...{
                while(1<q1.size())...{
                    q2.push(q1.front());
                    q1.pop();
                }
                cout<<q1.front()<<endl;
                q1.pop();
            }else...{
                cout<<"stack is empty,please enter"<<endl;
            }
        }
        c=getchar();//get掉换行
    }
    return 1;
}