USACO Training Section 1.2 双重回文数 Dual Palindrom

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
bool solve(int a,int b);
bool flag;
int main()
{
       long long x,y,z=0;
       cin>>x>>y;
      while(z<x)
       {
            y++;
           int w=0;
           for(int i=2;i<=10;i++)
           {
               if(solve(y,i)) w++;
               if(w>1) {
                    cout<<y<<endl;
                    z++;
                break;
               }
           }
       }
   //    cout<<solve(x,y);
        return 0;
}
bool solve(int a,int b)
{
    string d;
    d.clear();
    int i=0;
    char c;
    while(a%b!=a)
    {
        i=a%b;
        if(i>=10) c=char(i+55);
        else c=i+'0';
        a=a/b;
       d.push_back(c);
    }
    if(a>=10) c=char(a+55);
    else c=a+'0';
    d.push_back(c);
    string e=d;
    reverse(d.begin(),d.end());
    if(e==d) return 1;
    return 0;
}