hdoj2029 Palindromes _easy version

Palindromes _easy version

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32251    Accepted Submission(s): 19639

Problem Description

“回文串”是一个正读和反读都一样的字符串，比如“level”或者“noon”等等就是回文串。请写一个程序判断读入的字符串是否是“回文”。

 

Input

输入包含多个测试实例，输入数据的第一行是一个正整数n,表示测试实例的个数，后面紧跟着是n个字符串。

 

Output

如果一个字符串是回文串，则输出"yes",否则输出"no".

 

Sample Input

  
  

   
   4
level
abcde
noon
haha
  
  

 

Sample Output

  
  

   
   yes
no
yes
no
  
  

 

Author

lcy

 

Source

C语言程序设计练习（五）

5min的水题....

#include<iostream>
#include<cstdio>
#include<string>
#include<sstream>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<deque>
#include<cmath>
#include<climits>
#include<list>
#include<utility>
#include<memory>
#include<cstddef>
#include<iterator>

using namespace std;
typedef long long LL;
const double pi = acos(-1.0);
///
void judge(string input) {
	int a = 0;
	int b = input.size()-1;
	while (a < b) {
		if (input[a] != input[b]) {
			cout << "no\n";
			return;
		}
		a++;
		b--;
	}
	cout << "yes\n";
	return;
}



///
int main(int argc, char**argv) {
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	
	
	int times;
	while (cin >> times) {
		//cin.ignore();
		while (times--) {
			string input;
			cin >> input;
			judge(input);
		}

	}







	
	//system("pause");
	return 0;
}