public class Vempire {

    public static void main(String[] arg) {

        String[] ar_str1, ar_str2;

        int sum = ;

        int from;

        int to;

        int i_val;

        int count = ;

        // 双重循环穷举

        for (int i = ; i < ; i++) {

          // j=i+1避免重复

          from = Math.max( / i, i + );

          to = Math.min( / i, );

          for (int j = from; j < to; j++) {

            i_val = i * j;  

            if (i_val %  ==  || (i_val - i - j) %  != ) {

              continue;

            }

            count++;

            ar_str1 = String.valueOf(i_val).split("");

            ar_str2 = (String.valueOf(i) + String.valueOf(j)).split("");

            Arrays.sort(ar_str1);

            Arrays.sort(ar_str2);

            if (Arrays.equals(ar_str1, ar_str2)) {// 排序后比较,为真则找到一组

              sum++;

              System.out.println("第" + sum + "组: " + i + "*" + j + "=" + i_val);

            }

          }

        }

        System.out.println("共找到" + sum + "组吸血鬼数");

        System.out.println(count);

      }

}