hduoj2163(Palindromes)

来源：互联网发布：如何开通淘宝蚂蚁花呗编辑：程序博客网时间：2024/05/21 06:35

Palindromes
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3275    Accepted Submission(s): 1903

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
ABCCBAAHELLOABABAMAABABPPASTOP
 

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

#include<stdio.h>#include<string.h>char a[60];int main(){ int k=1; while(gets(a),strcmp(a,"STOP")!=0) {     int i,t;     t=strlen(a);     for(i=0;i<t/2;i++)     {        if(a[i]!=a[t-i-1])        break;     }     printf("#%d: ",k++);     if(i>=t/2)     printf("YES\n");     else     printf("NO\n"); }  return 0;   }

0 0