题解

#include<bits/stdc++.h>
using namespace std;

bool pal(string s)
{
    bool is_pal=1;
    for (int i=0;i<ceil(s.size()*1.0/2);i++)
    {
        if (s[i]!=s[s.size()-i-1])
        {
            is_pal=0;
            break;
        }
    }
    return is_pal;
}
string type(string s)
{
    bool l=0,n=0;
    for (int i=0;i<s.size();i++)
    {
        if (s[i]>='A' && s[i]<='Z' || s[i]>='a' && s[i]<='z')
            l=1;
        if (s[i]>='0' && s[i]<='9')
            n=1;
    }
    if (l && !n)
        return "letter\n";
    else if (n && !l)
        return "number\n";
    else
        return "string\n";
}
int main()
{
    string a,b;
    cin >> a >> b;
    int n;
    cin >> n;
    for (int i=0;i<n;i++)
    {
        string com;
        cin >> com;
        string s="";
        for (int i=0;i<com.size();i++)
        {
            if (com[i]=='a')
                s+=a;
            else
                s+=b;
        }
        cout << s << endl << (pal(s) ? "palindrome ":"non-palindrome ") << type(s);
    }
    return 0;
}