SWUST OJ(1028)

特定字符序列的判断

 #include <iostream>
 #include <cstdlib>
 #include <stack>
 #include <string>
 using namespace std;

 int main()
 {
     stack<char> s;
     stack<char> s1;
     char c, c1;
     string str;
     cin>>str;
     int i=;
     while()
     {
         c = str[i];
         if (c == '#')
         {
             break;
         }
         s.push(c);
         i++;
     }

     while()
     {
         c1 = s.top();
         s.pop();
         if (c1 == '@')
         {
             break;
         }
         s1.push(c1);
     }

     if (s.size()!=s1.size())
     {
         cout<<"no!";
         return ;
     }

     while(!s.empty())
     {
         if(s.top()!=s1.top())
         {
             cout<<"no!";
             return ;
         }
         s.pop();
         s1.pop();
     }

     cout<<"yes!";

     return ;
 }