Division

 1 #include <cstdio>
 2 #include <cstring>
 3 
 4 bool vis[10];
 5 char str[15];
 6 
 7 bool check(int a, int b)
 8 {
 9     sprintf(str, "%05d%05d", a, b);
10     memset(vis, 0, sizeof(vis));
11     for (int i = 0; i < 10; i++)
12     {
13         if (vis[str[i]-‘0‘])  return false;
14         vis[str[i]-‘0‘] = true;
15     }
16     return true;
17 }
18 
19 int main()
20 {
21     int n;
22     bool first = true;
23     while (scanf("%d", &n) && n)
24     {
25         bool exist = false;
26         if (first)  first = false;
27         else  printf("\n");
28         for (int i = 1234; i <= 98765; i++)
29         {
30             int ans;
31             if (i % n == 0)
32             {
33                 ans = i / n;
34                 if (ans < 1234)  continue;
35                 if (check(i, ans))
36                 {
37                     exist = true;
38                     printf("%05d / %05d = %d\n", i, ans, n);
39                 }
40             }
41         }
42         if (!exist)  printf("There are no solutions for %d.\n", n);
43     }
44     return 0;
45 }