ZOJ 1078 枚举法

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>


int main()
{
    int i, t, j, m, ncases;
    int num, k, flag,a[18];
    
    while(scanf("%d",&num) != EOF)
    {
       if(num == 0) break;
       flag = 0;
       for(i=2; i<=16; i++)
       {
           a[i] = 0;
           t = num;
           m = 0; 
           while( t )
           {
              m = m*i + t%i;
              t /= i;
           } 
           if(m== num)
           {
             a[i] = 1;
             flag = 1;
           }
       }   
    if( flag )
    {
       printf("Number %d is palindrom in basis",num);
       for(i = 2; i <= 16; i++)
       {  
            if(a[i] == 1) 
              printf(" %d",i);
       } 
       printf("\n");
    }   
    else
    {
        printf("Number %d is not a palindrom\n",num);         
    } 
   }
    
   return 0;
}