UVA - 401 Palindromes

#include <iostream>
#include <cstdio>
#include <ctype.h>
#include <string.h>
using namespace std;
char table[]="A   3  HIL JM O   2TUVWXY51SE Z  8 ";
int palindrome(char *s)
{
    int l=strlen(s),i,j;
    for(i=0,j=l-1;i<j;i++,j--)
    {
        if((s[i]=='O'||s[i]=='0')&&(s[j]=='O'||s[j]=='0'))
            continue;
        else if(s[i]==s[j])
            continue;
        else break;
    }
    return i>=j?1:0;
}
int mirrored(char *s)
{
    int l=strlen(s),i=l%2?l/2:l/2-1,j=l/2;//与回文不同的是若l为奇数，需要判定正中元素是否自身成镜像，此时i=j=l/2；若l为偶数，i=l/2-1，j=l/2
    for(;i>=0;i--,j++)
    {
        if(isalpha(s[i]))
        {
            if(s[i]=='O'&&s[j]!='O'&&s[j]!='0')
                break;
            else
            {
                if(s[j]!=table[s[i]-'A'])
                    break;
            }
        }
        else
        {
            if(s[i]=='0'&&s[j]!='O'&&s[j]!='0')
                break;
            else
            {
                if(s[j]!=table[s[i]-'1'+26])
                    break;
            }
        }
    }
    return i==-1?1:0;
}

int main()
{
    int flag1,flag2;
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    char s[1000];
    while(gets(s))
    {
        flag1=0;
        flag2=0;
        flag1=palindrome(s);
        flag2=mirrored(s);
        if(flag1&&flag2)
            cout<<s<<" -- is a mirrored palindrome.";
        if(flag1&&!flag2)
            cout<<s<<" -- is a regular palindrome.";
        if(!flag1&&flag2)
            cout<<s<<" -- is a mirrored string.";
        if(!flag1&&!flag2)
            cout<<s<<" -- is not a palindrome.";
        cout<<endl<<endl;
    }
    return 0;
}