CSU-1260

http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1260

回文串，我用到了栈和队列。

#include <iostream>#include <queue>#include <stack>#include <string.h>using namespace std;int main(){char a[101];int flag=1;queue<char> Q;stack<char> S;while (scanf("%s",a)!=EOF){while(S.size()!=0)S.pop();while(Q.size()!=0)Q.pop();int num=strlen(a);int re=1;for(int i=0;i<num;i++){S.push(a[i]);Q.push(a[i]);}for(int j=0;j<num;j++){if(Q.front()-S.top()!=0)re=0;Q.pop();S.pop();}if(re==1)cout<<"case"<<flag<<": yes"<<endl;else cout<<"case"<<flag<<": no"<<endl;flag++;}return 0;}