Dual Palindromes

链接

分析：直接暴力求解，傻逼题

/*
    ID:wanghan
    PROB:dualpal
    LANG:C++
*/
#include "iostream"
#include "cstdio"
#include "cstring"
#include "string"
using namespace std;
string Rev(int num,int b){
    string t="";
    while(num){
        int z=num%b;
        if(z>=10)
            t+=(z-10)+'A';
        else
            t+=z+'0';
        num/=b;
    }
    int len=t.length();
    int i=0,j=len-1;
    while(i<j){
        swap(t[i],t[j]);
        i++,j--;
    }
    return t;
}
bool judge(string s,int i,int j){
    while(i<j){
        if(s[i]==s[j]){
            i++,j--;
        }else{
            return false;
        }
    }
    return true;
}
int n,s;
int main()
{
    freopen("dualpal.in", "r", stdin);  
    freopen("dualpal.out", "w", stdout);
    cin>>n>>s;
    int cnt=0;
    //int flag=0;
    while(1){
        ++s;
        int tt=0,flag=0;
        for(int i=2;i<=10;i++){
            string t=Rev(s,i);
            int len=t.length()-1;
            if(judge(t,0,len)){
                tt++;
            }
            if(tt>=2){
                flag=1; break;
            }
        }
        if(flag){
            cnt++;
            cout<<s<<endl;
        }
        if(cnt==n)  break;
    }
}