Palindromes

?UVA - 401?

題目傳送門

題目大意：給你一個字符串，判斷其是回文串還是鏡像串。

AC代碼：

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <set>
#include <utility>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define lep(i,l,r) for(int i=l;i>=r;i--)
#define ms(arr) memset(arr,0,sizeof(arr))
//priority_queue<int,vector<int> ,greater<int> >q;
const int maxn = (int)1e5 + 5;
const ll mod = 1e9+7;
char s1[]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ123456789"};
char s2[]={"A   3  HIL JM O   2TUVWXY51SE Z  8 "};
char ss1[maxn],ss2[maxn];
char str[maxn];
int main() 
{//freopen("in.txt", "r", stdin);//freopen("out.txt", "w", stdout);map<char,char>m;rep(i,0,35) {m[s1[i]]=s2[i];}while(scanf("%s",str)!=EOF){ms(ss1);ms(ss2);bool ju1=true,ju2=true;   //ju1表示它是回文串，ju2表示它是鏡像串int len=strlen(str);rep(i,0,len/2-1) {if(str[i]!=str[len-i-1])     //判斷其不是回文串ju1=false;}rep(i,0,len-1) {if(m[str[i]]==' ')        //其鏡像后無法得到一個有效字符，說明其不是鏡像串{ju2=false;break;}else{ss1[len-i-1]=m[str[i]];    //左鏡像串ss2[i]=m[str[len-i-1]];    //右鏡像串}}ss1[len]='\0';ss2[len]='\0';if(ju2==true){if(strcmp(ss1,str)!=0||strcmp(ss2,str)!=0)     //若左右鏡像與原字符串不等，這其不是鏡像串ju2=false;}if(ju1==false&&ju2==false)           //根據結果輸出printf("%s -- is not a palindrome.\n\n",str);else if(ju1==true&&ju2==false)printf("%s -- is a regular palindrome.\n\n",str);else if(ju1==false&&ju2==true)printf("%s -- is a mirrored string.\n\n",str);elseprintf("%s -- is a mirrored palindrome.\n\n",str);}return 0;
}

?