POJ 2769 Reduced ID Numbers 解题报告

暴力AC了...

# include<stdio.h>
# define MAX 300
int s[ MAX ];
int m[ MAX ];
int main()
{
    int n ,  g ,  i ,  j ,  k;
    scanf( " %d " ,   & n);
     while (n -- )
    {
        scanf( " %d " ,   & g);
        memset(s ,   0 ,   sizeof (s));
        memset(m ,   0 ,   sizeof (m));
         for (i = 0 ; i < g; i ++ )
        {
            scanf( " %d " ,  s + i);
        }
         for (j = 1 ; ; j ++ )
        {
             for (i = 0 ; i < g; i ++ )
            {
                m[i]  =  s[i]  %  j;
            }
             for (i = 0 ; i < g; i ++ )
            {
                 for (k = i + 1 ; k < g; k ++ )
                {
                     if (m[k]  ==  m[i])
                         break ;
                }
                 if (k  !=  g)
                     break ;
            }
             if (i  ==  g)
                 break ;
        }
         printf ( " %d/n " ,  j);
    }
     return   0 ;
}