暴力枚举 UVA 725 Division

题目传送门

 /*
     暴力：对于每一个数都判断，是否数字全都使用过一遍
 */
 #include <cstdio>
 #include <iostream>
 #include <algorithm>
 #include <cmath>
 #include <cstring>
 #include <string>
 #include <map>
 #include <set>
 #include <queue>
 using namespace std;

 const int MAXN  = 1e4 + ;
 const int INF = 0x3f3f3f3f;
 int vis[];

 bool ok(int x, int y)
 {
     memset (vis, , sizeof (vis));
     for (int i=; i<=; ++i)
     {
         vis[x%]++;    vis[y%]++;
         if (vis[x%] >  || vis[y%] > )    return false;
         x /= ;    y /= ;
     }

     return true;
 }

 int main(void)        //UVA 725 Division
 {
     //freopen ("UVA_725.in", "r", stdin);

     int n, cnt = ;
     while (scanf ("%d", &n) == )
     {
         if (n == )    break;
         if (cnt++)    puts ("");

         int one = ;
         for (int i=; i<=/n; ++i)
         {
             if (i * n > )    break;
             if (ok (i, i*n) == true)
             {
                 printf ("%05d / %05d = %d\n", n*i, i, n);    one++;
             }
         }

         if (!one)    printf ("There are no solutions for %d.\n", n);
     }

     return ;
 }

 /*
 There are no solutions for 61.
 */