Dual Palindromes

Dual Palindromes

Mario Cruz (Colombia) & Hugo Rickeboer (Argentina)
A number that reads the same from right to left as when read from left to right is called a palindrome. The number 12321 is a palindrome; the number 77778 is not. Of course, palindromes have neither leading nor trailing zeroes, so 0220 is not a palindrome.


The number 21 (base 10) is not palindrome in base 10, but the number 21 (base 10) is, in fact, a palindrome in base 2 (10101).


Write a program that reads two numbers (expressed in base 10):


N (1 <= N <= 15)
S (0 < S < 10000)
and then finds and prints (in base 10) the first N numbers strictly greater（就是大于嘛） than S that are palindromic when written in two or more（满足两种或以上） number bases (2 <= base <= 10).
Solutions to this problem do not require manipulating integers larger than the standard 32 bits.

PROGRAM NAME: dualpal

INPUT FORMAT

A single line with space separated integers N and S.

SAMPLE INPUT (file dualpal.in)

3 25

OUTPUT FORMAT

N lines, each with a base 10 number that is palindromic when expressed in at least two of the bases 2..10. The numbers should be listed in order from smallest to largest.

SAMPLE OUTPUT (file dualpal.out)

26
27
28

/*
ID: des_jas1
PROG: dualpal
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <string.h>
#include <stdlib.h>
//#define fin cin
//#define fout cout
using namespace std;

int N;
char after[32];

int trans(int m,int tp)
{
	int i=0;
	while(tp>=m)
    {
        after[i]=tp%m; 
        tp=tp/m;
		i++;
    }
	after[i]=tp;
	return i;//返回最大下标
}

bool Is_Palin(int s)
{	
	int i,r,j,flag,count=0;
	for(r=2;r<=10;r++)//从2进制开始试
	{
		j=trans(r,s);//转换一下
		flag=1;
		for(i=0;i<=j;i++,j--)
		{
			if(after[i]!=after[j]) //判断回文
			{
				flag=0;
				break;
			}
		}
		if(flag)//正常退出说明上一个尝试满足
		{
			count++;
			if(count==2)//两个满足就ok
				return true;
		}
	}
	return false;

}

int main() 
{
	ofstream fout ("dualpal.out");
    ifstream fin ("dualpal.in");
	int S;
	fin>>N>>S;
	while(N)//找N个
	{
		S++;//严格大于
		if(Is_Palin(S))
		{
			fout<<S<<endl;
			N--;
		}
	}
	fout.close();
	fin.close();
    return 0;
}