USACO 1.2 Dual Palindromes

进制转换，回文判断，暴力解法。

/*
	ID: acmerfi1
	PROG: dualpal 
	LANG: C++ 
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 100

int N, S, sum1 = 0, sum = 0,sumDigit = 0;
int num[MAX];

int changeBase(int num[], int base, int t) //进制转换 
{
	int i = 0;
	while(t)
	{
		num[i++] = t % base;
		t /= base;
	}
	return i; 		
}

int judge(int num[], int sumDigit) // 回文判断 
{
	int flag = 0;
	for(int i = 0; i <= sumDigit/2; i++)
	{
		if(num[i] == num[sumDigit - i - 1]) flag = 1;
		else
		{
			flag = 0;
			break;	
		}
	}
	return flag;
}


int main()
{
	freopen("dualpal.in", "r", stdin);
	freopen("dualpal.out", "w", stdout);
	scanf("%d%d", &N, &S);
	for(int i = S+1; sum < N; i++)
	{
		sum1 = 0;
		for(int j = 2; j <= 10; j++)
		{
			memset(num, 0, sizeof(num));
			sumDigit = changeBase(num, j, i);
			if(judge(num, sumDigit)) sum1++;
			if(2 == sum1)
			{
				sum++;
				printf("%d\n", i);
				break;
			}
		}
	}
	return 0;
}