1 import java.math.BigInteger;
 2 import java.util.ArrayList;
 3 import java.util.Collections;
 4
 5 public class Main {
 6     public static ArrayList<BigInteger> set = new ArrayList<BigInteger>();
 7     public static BigInteger[] value = new BigInteger[10];
 8     public static int count = 0;
 9
10     public BigInteger getPow(BigInteger n) {
11         BigInteger result = BigInteger.ONE;
12         for(int i = 1;i <= 21;i++)
13             result = result.multiply(n);
14         return result;
15     }
16
17     public boolean check(int[] A) {
18         BigInteger temp = BigInteger.ZERO;
19         for(int i = 0;i < 10;i++) {
20             BigInteger k = new BigInteger(""+A[i]);
21             temp = temp.add(value[i].multiply(k));
22         }
23         String s = "" + temp;
24         if(s.length() != 21)
25             return false;
26         int[] B = new int[10];
27         for(int i = 0;i < 21;i++) {
28             int k = s.charAt(i) - '0';
29             B[k]++;
30         }
31         for(int i = 0;i < 10;i++)
32             if(A[i] != B[i])
33                 return false;
34         return true;
35     }
36
37     public void dfs(int step, int sum, int[] A) {
38         if(step == 10) {
39             if(sum == 21 && check(A)) {
40                 BigInteger temp = BigInteger.ZERO;
41                 for(int i = 0;i < 10;i++) {
42                     BigInteger k = new BigInteger(""+A[i]);
43                     temp = temp.add(value[i].multiply(k));
44                 }
45                 if(!set.contains(temp))
46                     set.add(temp);
47                 count++;
48             }
49             return;
50         } else {
51             for(int i = 0;i <= 21 - sum;i++) {
52                 A[step] = i;
53                 dfs(step + 1, sum + i, A);
54             }
55         }
56     }
57
58     public static void main(String[] args) {
59         Main test = new Main();
60         for(int i = 0;i <= 9;i++) {
61             BigInteger a = new BigInteger(""+i);
62             value[i] = test.getPow(a);
63         }
64         int[] A = new int[10];
65         test.dfs(0, 0, A);
66         Collections.sort(set);
67         for(int i = 0;i < set.size();i++)
68             System.out.println(set.get(i));
69     }
70 }

128468643043731391252
449177399146038697307