UVa401

#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<map> 
#include<set>
#include<sstream>
#include<functional>
#include<cassert>
#include<list>
#include<iterator>
#include<utility>
#include <stdexcept>  
#include <sstream>
#include <fstream> 
#include<unordered_map>
#include<unordered_set>
#include<ctype.h>


using namespace std;
using namespace std::placeholders;

string str = "A   3  HIL JM O   2TUVWXY51SE Z  8 ";

int main()
{
    string line;
    bool flag1, flag2;
    while (getline(cin, line))
    {
        flag1 = false;
        flag2 = true;
        int len = line.size();
        string a, b;
            if (line.size() % 2 == 0)
            {
                 a = line.substr(0, len / 2);
                 b = line.substr(len / 2, len / 2);
            }
            else
            {
                 a = line.substr(0, len / 2);
                 b = line.substr(len / 2 + 1, len / 2);
            }
        reverse(a.begin(), a.end());
            if (a == b)
            {
                flag1 = true;
            }

            for (auto i = 0; i < (len+1)/ 2; i++)//通过常量数组判断是不是常量数组
            {
                int k;
                if (isalpha(line[i]))
                    k = line[i] - 'A';
                else
                    k = line[i] - '0' + 25;
                if (str[k] != line[len - i - 1])
                    flag2 = false;
            }
        if (flag1 == true &&flag2 == true)
            cout << line << " -- is a mirrored palindrome.\n\n";
        else if (flag1 == false && flag2 == true)
            cout << line << " -- is a mirrored string.\n\n";
        else if (flag1 == true && flag2 ==false)
            cout << line << " -- is a regular palindrome.\n\n";
        else
        cout << line << " -- is not a palindrome.\n\n";
    }
    return 0;
}

白书上的程序

#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<map> 
#include<set>
#include<sstream>
#include<functional>
#include<cassert>
#include<list>
#include<iterator>
#include<utility>
#include <stdexcept>  
#include <sstream>
#include <fstream> 
#include<unordered_map>
#include<unordered_set>
#include<ctype.h>


using namespace std;
using namespace std::placeholders;

const char* rev= "A   3  HIL JM O   2TUVWXY51SE Z  8 ";
const char* msg[] = { "not a palindrome", "a regular palindrome", "a mirrored string", "a mirrored palindrome" };

char r(char ch)
{
    if (isalpha(ch))return rev[ch - 'A'];
    return rev[ch - '0' + 25];
}

int vs_main()
{
    char s[30];
    while (scanf("%s", s) == 1)
    {
        int len = strlen(s);
        int p = 1, m = 1;
        for (int i = 0; i < (len + 1) / 2; i++)
        {
            if (s[i] != s[len - i - 1])p = 0;
            if (r(s[i]) != s[len - i - 1])m = 0;
        }
        printf("%s -- is %s.\n\n", s, msg[m * 2 + p]);
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值