hduoj2163(Palindromes)属于回文类别

最新推荐文章于 2024-11-16 18:17:18 发布

原创最新推荐文章于 2024-11-16 18:17:18 发布 · 371 阅读

0 ·

CC 4.0 BY-SA版权

基础的C语言编程和知识专栏收录该内容

36 篇文章

订阅专栏

本文详细分析了hduoj2163编程挑战，该题目涉及回文概念。通过实例解析，深入理解回文字符串的特点和判断方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
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<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;   
}