dual palindromes

#include<iostream>
#include<fstream>
#include<string>
#include<cmath>
using namespace std;
int main()
{
	char a[]={'0','1','2','3','4','5','6','7','8','9'};
	ifstream fin ("dualpal.in");
	ofstream fout ("dualpal.out");
	int n,s,i,j;
	fin>>n>>s;
	for(j=s+1,i=0;i<n;j++)
	{
		int ary=2;//初始化进制为二进制
		int k=0;//保存有几个进制是双回文
		int q,m,n;
		for(ary=2;ary<=11;ary++)
		{
			string b;
			if(k==2)
			{
				i++;
				fout<<j<<endl;
				break;
			}
			q=j;
			while(q!=0)
			{
				b=b+a[q%ary];
				q=q/ary;
			}
			char c=true;
			for(m=0,n=b.length()-1;m<b.length()/2 &&n>=b.length()/2;m++,n--)
			{
				if(b[m]!=b[n])
				{
					c=false;
					break;
				}
			}
			if(c)
			{
				k++;
			}
		}
	}
	return 0;
}