COJ 1151 STL中的stack每日一水

X则入栈，Y则出栈，判断到最后一个字母时是不是为空，非空输出Joopoo,空输出pzjay.

#include <iostream>#include <map>#include <deque>#include <queue>#include <stack>#include <string>#include <cstring>#include <cstdio>#include <cmath>#include <algorithm>#include <map>#include <set>using namespace std;int main(){    stack<char>p;    int i=1,l;    string a;    cin>>a;    if(a[0]=='Y') {cout<<"Joopoo"<<endl;return 0;}    l=a.length();    p.push(a[0]);    while(i<l)    {        if(p.empty()==true&&a[i]=='Y') break;        else if(!p.empty()&&a[i]=='Y') p.pop();        else p.push(a[i]);        i++;    }    if(i==l&&p.empty()==true) cout<<"Pzjay"<<endl;    else cout<<"Joopoo"<<endl;    return 0;}