Problem: Decompose a positive integer into prime factors. For example: input 90 and print out 90=2* 3* 3* 5.
public class example1 {
static Vector<Integer> v=new Vector<Integer>();
public static boolean f0(int n) {
for(int i=2;i<Math.sqrt(n);i++) {
if(n%i==0) {
v.remove(v.size()-1);
v.add(i);
v.add(n/i);
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
v.add(sc.nextInt());
while(f0(v.get(v.size()-1))==false) {
}
for(int i=0;i<v.size();i++) {
System.out.println(v.get(i));
}
}
}