# 广度优先懵逼VS深度优先懵逼

import java.util.ArrayList;

public class Test {

public static void main(String[] arg0) {
int i;
ArrayList<ArrayList<String>> parts = new ArrayList<ArrayList<String>>();
while ((i = answer.indexOf("<alter=")) >= 0) {
ArrayList<String> string = new ArrayList<String>();
try {
String[] alternatives = alter.split("[*]");
ArrayList<String> alternative = new ArrayList<String>();
for (int k = 0; k < alternatives.length; k ++) alternative.add(alternatives[k]);
} catch (IndexOutOfBoundsException e) {
break;
}
}
ArrayList<String> string = new ArrayList<String>();
//广度优先懵逼
for (i = 0; i < multiplicativeSize(parts, 0, parts.size()); i ++) answers.add("");
for (i = 0; i < parts.size(); i ++) {
for (int j = 0; j < multiplicativeSize(parts, 0, i + 1); j ++) {
for (int k = 0; k < multiplicativeSize(parts, i + 1, parts.size()); k ++) {
int targetIndex = j * multiplicativeSize(parts, 0, parts.size()) /
multiplicativeSize(parts, 0, i + 1) + k;
int sourceIndex = j % parts.get(i).size();
}
}
}
//打印并清空
System.out.println("");
//深度优先懵逼
i = multiplicativeSize(parts, 0, parts.size());
for (int j = 0; j < i; j ++) {
for (int k = 0; k < parts.size(); k ++)
}
}

static int multiplicativeSize(ArrayList<ArrayList<String>> arrayList, int beginIndex, int endIndex) {
int result = 1;
if (beginIndex < endIndex)
for (int i = beginIndex; i < endIndex; i ++) result *= arrayList.get(i).size();
return result;
}
}


123569
123579
123589
124569
124579
124589

123569
124579
123589
124569
123579
124589