UVA-401 字符串

题目传送门: http://bak.vjudge.net/problem/UVA-401


题意:给一张表上面对应的是A-Z,1-9的镜像字符,然后输入一串字符串问字符串是否为镜像字符串或回文字符串


简单的建表模拟,算是个水题吧


代码如下:

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;

#define   lowbit(x)     x&(-x)
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   ll            long long
#define   ull           unsigned long long
#define   mem(n,v)      memset(n,v,sizeof(n))
#define   MAX           1000005
#define   MAXN          2000005
#define   PI            3.1415926
#define   E             2.718281828459
#define   opnin         freopen("text.in.txt","r",stdin)
#define   clsin         fclose(stdin)

const int    INF    =   0x3f3f3f3f;
const ll     INFF   =   0x3f3f;
const double pi     =   3.141592653589793;
const double inf    =   1e18;
const double eps    =   1e-8;
const ll     mod    =   1e9+7;
const ull    mx     =   133333331;

const char str1[] = "A   3  HIL JM O   2TUVWXY5";//mirror char
const char str2[] = "1SE Z  8 ";//mirror num

char str[MAX];
bool is_mirrored()
{
    int len = strlen(str);
    int mid = len/2;
    for(int i = 0;i<len/2;i++){
        if(str[i] >= 'A'){
            if(str[len-i-1] != str1[str[i]-'A']) return false;
        }
        else{
            if(str[len-i-1] != str2[str[i]-'1']) return false;
        }
    }
    if(len & 1 == 1){
        if(str[len/2] >= 'A'){
            if(str[len/2] != str1[str[len/2]-'A']) return false;
        }
        else{
            if(str[len/2] != str2[str[len/2]-'1']) return false;
        }
    }

    return true;
}
bool is_palindrome()
{
    int len = strlen(str);
    for(int i=0;i<len/2;i++)
        if(str[i] != str[len-i-1]) return false;

    return true;
}

int main()
{
    while(scanf("%s",str) != EOF){
        bool flag1 = is_mirrored();
        bool flag2 = is_palindrome();
        printf("%s -- is ",str);
        if(flag1 && flag2) printf("a mirrored palindrome.\n");
        else if(flag1) printf("a mirrored string.\n");
        else if(flag2) printf("a regular palindrome.\n");
        else printf("not a palindrome.\n");
        cout << endl;
    }

    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值