Solution_7206_2.java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

//2019-03-05
//SWEA 7206 ¼ýÀÚ°ÔÀÓ

public class Solution_7206_2 {
	public static int max = Integer.MIN_VALUE;
	public static int turn;
	public static int[] set;
	public static void main(String[] args) throws Exception {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));

		int T = Integer.parseInt(bf.readLine());

		for (int tc = 1; tc <= T; tc++) {
			max = Integer.MIN_VALUE;
			String num = bf.readLine();
			int size = num.length();
			if (size == 1) {
				System.out.println("#" + tc + " 0");
				continue;
			}
			
			solve(num);

			System.out.println("#" + tc + " " + max);
		} // end of tc
	}// end of main
	
	
	public static void solve(String num) {
		int size = num.length();
		
		if(size==1) {
			max=max<turn? turn:max;
			turn--;
			return;
		}
		for(int i=1;i<size;i++) {
			set = new int[i];
			comb(size, 0, i, 0);// (size-1)Ci
			solve(split(num));
		}
	

	}

	public static void comb(int size, int len, int r, int k) {// (size-1)Cr

		if (len == r) {
			System.out.println(Arrays.toString(set));
			return;

		}

		for (int i = k; i < size - 1; i++) {
			set[len] = i;
			comb(size, len + 1, r, i + 1);

		}

	} // end of comb method

	public static String split(String num) {
		turn++;
		int p = Integer.parseInt(num.substring(0, set[0] + 1));
		for (int i = 1; i < set.length; i++) {
			p *= Integer.parseInt(num.substring(set[i - 1] + 1, set[i] + 1));

		}
		p *= Integer.parseInt(num.substring(set[set.length - 1] + 1, num.length()));

		return ""+p;
	} // end of split method
}