1078china95.cpp

zju_acm部分代码！都是自己做 有些事基本题目！题目还可以

#include <cstdio>
#include <string>

int Palindrom(int a[],int i,int k)
{
	for(int j=1;j<=i/2;j++)
	{
		if(a[j]!=a[1+i-j])
			return 0;
	}
	return k;
}

int main()
{
	int n;
	while(1==scanf("%d",&n)&&n)
	{
		
		int num[15];
		int num_palindrom[17];
		memset(num_palindrom,0,sizeof(num_palindrom));
		int i,j=2;
		for(int base=2;base<=16;base++)
		{
			int temp=n;
			i=1;
			while(temp>=base)
			{
				num[i++]=temp%base;
				temp=temp/base;
			}
			num[i]=temp;
			num_palindrom[j++]=Palindrom(num,i,base);
		}
		int k=1;
		for(i=2;i<=16;i++)
		{
			if(!k&&num_palindrom[i]!=0)		printf(" %d",num_palindrom[i]);

			if(num_palindrom[i]!=0&&k)
			{
				printf("Number %d is palindrom in basis %d",n,num_palindrom[i]);
				k=0;
			}
		}
		if(k) printf("Number %d is not a palindrom",n);
		
		 printf("\n");

		memset(num_palindrom,0,sizeof(num_palindrom));
	}
	return 0;
}