uva 725 DIVISION (暴力枚举)

我的56MS

 #include <cstdio>
 #include <iostream>
 #include <string>
 #include <cstring>
 #include <queue>
 #include <vector>
 #include <map>
 #include <cmath>
 using namespace std;

 #define MEM(a,v) memset (a,v,sizeof(a))
 // a for address, v for value

 #define max(x,y) ((x)>(y)?(x):(y))
 #define max(x,y) ((x)>(y)?(x):(y))

 #define debug printf("!\n")

 int num[];
 bool visited[];

 bool check(int a,int b)
 {
           MEM(visited,false);

           int j;

           for(j = ;j>=;j--)
           {
                     int tmp = a%;
                     num[j] = tmp;
                     a/=;
           }
           for(j = ;j>=;j--)
           {
                     int tmp = b%;
                     num[j] = tmp;
                     b/=;
           }

           for(j = ;j<=;j++)
           {
                     if(visited[num[j]])
                               return false;
                     visited[num[j]] = true;
           }
           return true;

 }

 int main()
 {
           int i,n,j,k,T=;
           while(~scanf("%d",&n) && n)
           {
                     if(T++)
                               printf("\n");
                     bool find = false;
                     for(i = ;i<=;i++)
                     {
                               if(i%n==)
                               {
                                         int m = i/n;
                                         if(check(i,m))
                                         {
                                                   find =true;
                                         for(j = ;j<=;j++)
                                                   printf("%d",num[j]);
                                         printf(" / ");
                                         for(j = ;j<=;j++)
                                                   printf("%d",num[j]);
                                         printf(" = %d\n",n);
                                         }
                               }
                     }
                     if(!find)
                               printf("There are no solutions for %d.\n",n);
           }

           return ;
 }

但要特别提一下这位仁兄写的，有狠多值得学习的地方

http://blog.csdn.net/mobius_strip/article/details/38735773

#include <iostream>
#include <cstdlib>
#include <cstdio>

using namespace std;

int used[];

int judge( int a, int b )
{
    //对于判断是否有重复的数字，可以用一个used数组
    //将用过的项置为1

    if ( b >  ) return ;
    for ( int i =  ; i <  ; ++ i )
        used[i] = ;
    if ( a <  ) used[] = ;
    while ( a ) {
        used[a%] = ;
        a /= ;
    }
    while ( b ) {
        used[b%] = ;
        b /= ;
    }
    int sum = ;
    for ( int i =  ; i <  ; ++ i )
        sum += used[i];
    return (sum == );
}

int main()
{
    int n, T = ;
    while ( ~scanf("%d",&n) && n ) {
        if ( T ++ ) printf("\n");
        int count = ;
        for ( int i =  ; i <  ; ++ i ) {
            if ( judge( i, i*n ) ) {
                printf("%05d / %05d = %d\n",i*n,i,n);
                //可以用%05d填充，就不用数组来保存数字了
                count ++;
            }
        }
        if ( !count )
            printf("There are no solutions for %d.\n",n);
    }
    return ;
}