HDU 2163 Palindromes

最新推荐文章于 2019-10-25 16:11:27 发布

你迎哥哥

最新推荐文章于 2019-10-25 16:11:27 发布

阅读量744

点赞数

分类专栏： HDU 模拟-简单字符串操作

本文链接：https://blog.csdn.net/u013615904/article/details/42921007

版权

HDU 同时被 2 个专栏收录

226 篇文章 1 订阅

订阅专栏

模拟-简单字符串操作

11 篇文章 0 订阅

订阅专栏

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2163

Palindromes

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3256 Accepted Submission(s): 1891

Problem Description

Write a program to determine whether a word is a palindrome. A palindrome is a sequence of characters that is identical to the string when the characters are placed in reverse order. For example, the following strings are palindromes: “ABCCBA”, “A”, and “AMA”. The following strings are not palindromes: “HELLO”, “ABAB” and “PPA”.

Input

The input file will consist of up to 100 lines, where each line contains at least 1 and at most 52 characters. Your program should stop processing the input when the input string equals “STOP”. You may assume that input file consists of exclusively uppercase letters; no lowercase letters, punctuation marks, digits, or whitespace will be included within each word.

Output

A single line of output should be generated for each string. The line should include “#”, followed by the problem number, followed by a colon and a space, followed by the string “YES” or “NO”.

Sample Input

  
  
   
   ABCCBA
A
HELLO
ABAB
AMA
ABAB
PPA
STOP

Sample Output

  
  
   
   #1: YES
#2: YES
#3: NO
#4: NO
#5: YES
#6: NO
#7: NO

判断给出的字符串是否为回文串。。。大水题

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    string s,str;
    int t=1;
    while(cin>>s&&s!="STOP")
    {
        str=s;
        reverse(s.begin(),s.end());
        if(str==s) cout<<"#"<<t++<<": YES"<<endl;
        else cout<<"#"<<t++<<": NO"<<endl;
    }
    return 0;
}