剔除相关数 （C语言代码）

#include <stdio.h>
int main()
{
     int i,j,k,l,m,n,t=0,p,flag=1,N;
     int a[1000][100],b[1000],c[1000],d[1000];

     while(scanf("%d",&N)&&N)
     {  
               k=0;l=0;flag=1;
               for(i=0;i<N;i++)
               {
                    scanf("%d",&b[i]);
                    p=b[i];
                    j=0;
                    if(p==0)continue;
     
                    while(p!=0)
                    {
                             a[i][j++]=p%10;
                             p/=10;
                     }     
     
                    for(m=0;m<j;m++)
                    {
                         for(n=m+1;n<j;n++)
                         {
                              if(a[i][m]>a[i][n]){t=a[i][m];a[i][m]=a[i][n];a[i][n]=t;}
                         }
                     }
                    for(m=0;m<j;m++)
                    {
                         p=p*10+a[i][m];
                     }
                    c[i]=p;
                    }
     
                    for(i=0;i<N;i++)
                    {
                         flag=1;
                         for(j=0;j<N;j++)
                         {
                              if(j==i)continue;
                              if(c[i]==c[j]){flag=0;break;}
                          }
                         if(flag==1)d[l++]=b[i];
                      }         
   
                     if(l==0)printf("None\n");
                     else
                     {
                            for(i=0;i<l;i++)
                            {      
                                  for(j=i+1;j<l;j++)
                                  {
                                       if(d[i]>d[j]){t=d[i];d[i]=d[j];d[j]=t;}
                                   }      
                             }
                            for(i=0;i<l;i++)
                            {
                                  if(i<l-1)printf("%d ",d[i]);
                                  else printf("%d\n",d[i]);
                             }
                } 
     } 

     return 0;
}

解题思路:





注意事项:





参考代码: