--------------------------------------------------------------------------
递归更多的用在多分支情况中
本题用循环就可以了
用递归就麻烦了
--------------------------------------------------------------------------
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n1 = sc.nextInt();
int n2 = sc.nextInt();
int[] a = new int[n2-n1+1];
if(n1==n2)
a[0] = n1;
else
for(int i=n1,j=0;i<=n2;i++,j++)
a[j] = i;
for(int i=0;i<a.length;i++){
StringBuffer st = new StringBuffer(a[i]+"=");
int z = 2,tmp = a[i];
while(z<=tmp){
if(tmp%z==0){
if(st.charAt(st.length()-1)!='=')st.append("*");
st.append(z);
tmp = tmp/z;
z = 2;
}else
z++;
}
System.out.println(st);
}
}
}