zoukankan      html  css  js  c++  java
  • UVa_401 Palindromes

     Palindromes 

    A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to right as when the string is read from right to left.


    A mirrored string is a string for which when each of the elements of the string is changed to its reverse (if it has a reverse) and the string is read backwards the result is the same as the original string. For example, the string "3AIAE" is a mirrored string because "A" and "I" are their own reverses, and "3" and "E" are each others' reverses.


    A mirrored palindrome is a string that meets the criteria of a regular palindrome and the criteria of a mirrored string. The string "ATOYOTA" is a mirrored palindrome because if the string is read backwards, the string is the same as the original and because if each of the characters is replaced by its reverse and the result is read backwards, the result is the same as the original string. Of course, "A", "T", "O", and "Y" are all their own reverses.


    A list of all valid characters and their reverses is as follows.

    Character Reverse Character Reverse Character Reverse
    A A M M Y Y
    B   N   Z 5
    C   O O 1 1
    D   P   2 S
    E 3 Q   3 E
    F   R   4  
    G   S 2 5 Z
    H H T T 6  
    I I U U 7  
    J L V V 8 8
    K   W W 9  
    L J X X    


    Note that O (zero) and 0 (the letter) are considered the same character and therefore ONLY the letter "0" is a valid character.

    Input 

    Input consists of strings (one per line) each of which will consist of one to twenty valid characters. There will be no invalid characters in any of the strings. Your program should read to the end of file.

    Output 

    For each input string, you should print the string starting in column 1 immediately followed by exactly one of the following strings.

    STRING CRITERIA
    " -- is not a palindrome." if the string is not a palindrome and is not a mirrored string
    " -- is a regular palindrome." if the string is a palindrome and is not a mirrored string
    " -- is a mirrored string." if the string is not a palindrome and is a mirrored string
    " -- is a mirrored palindrome." if the string is a palindrome and is a mirrored string

    Note that the output line is to include the -'s and spacing exactly as shown in the table above and demonstrated in the Sample Output below.

    In addition, after each output line, you must print an empty line.

    Sample Input 

    NOTAPALINDROME 
    ISAPALINILAPASI
    2A3MEAS
    ATOYOTA

    Sample Output 

    NOTAPALINDROME -- is not a palindrome.

    ISAPALINILAPASI -- is a regular palindrome.

    2A3MEAS -- is a mirrored string.

    ATOYOTA -- is a mirrored palindrome.

    好几天没做UVa了, 这题是很有意思的字符串题目,呵呵,1A 代码:

    #include <stdio.h>
    #include
    <string.h>
    #define N 1000
    char map[127];
    void Map()
    {
    map[
    'A'] ='A';
    map[
    'E'] ='3';
    map[
    'H'] ='H';
    map[
    'I'] ='I';
    map[
    'J'] ='L';
    map[
    'L'] ='J';
    map[
    'M'] ='M';
    map[
    'O'] ='O';
    map[
    'S'] ='2';
    map[
    'T'] ='T';
    map[
    'U'] ='U';
    map[
    'V'] ='V';
    map[
    'W'] ='W';
    map[
    'X'] ='X';
    map[
    'Y'] ='Y';
    map[
    'Z'] ='5';
    map[
    '1'] ='1';
    map[
    '2'] ='S';
    map[
    '3'] ='E';
    map[
    '5'] ='Z';
    map[
    '8'] ='8';
    }
    int is_pa(char*s)
    {
    int i, n;
    n
    = strlen(s);
    for(i =0; i <= n/2; i++)
    if(s[i] != s[n-i-1])
    {
    return0;
    }
    return1;
    }

    int is_mo(char*s)
    {
    char s2[N];
    int n, i;
    n
    = strlen(s);
    for(i =0; i < n; i++)
    {
    s2[i]
    = map[s[i]];
    }
    for(i =0; i < n; i++)
    if(s2[i] != s[n-i-1])
    {
    return0;
    }
    return1;
    }

    int main()
    {
    char s[1000];
    Map();
    //freopen("data.in", "r", stdin);
    while(scanf("%s", s) != EOF)
    {
    int i, len = strlen(s);
    for(i =0; i < len; i++)
    if(s[i] =='0')
    s[i]
    ='O';
    if(is_pa(s))
    {
    if(is_mo(s))
    printf(
    "%s -- is a mirrored palindrome.\n", s);
    else
    printf(
    "%s -- is a regular palindrome.\n", s);
    }
    elseif(is_mo(s))
    {
    printf(
    "%s -- is a mirrored string.\n", s);
    }
    else
    printf(
    "%s -- is not a palindrome.\n", s);
    printf(
    "\n");
    }
    return0;
    }
  • 相关阅读:
    Word 转换为 PDf 的技术方案
    [转载]sql server 常用存储过程
    Redmine 初体验
    Quartz.net Tutorial Lesson 1
    [转载]sql server TSQL 区分字符串大小写 的两种方法
    [原创]sql server inner join 效率测试
    java实现树的一般操作
    【转】Mybatis中进行批量更新
    【转载】单例模式的7种写法(整合自两篇文章)
    mybtis批量insert传入参数为list
  • 原文地址:https://www.cnblogs.com/vongang/p/2139092.html
Copyright © 2011-2022 走看看