Java programming integer decomposition, java programming integer
Question: a positive integer is decomposed into a prime factor. For example, enter 90 and print 90 = 2*3*3*5.
The problem solving process is also very simple. The following code is directly used:
Import java. util. arrayList; import java. util. constraint; public class decompose {ArrayList <Integer> list = new ArrayList <Integer> (); Scanner s = new feature (System. in); int number = 2, value = 0; public static void main (String [] args) {decompose d = new decompose (); d. function ();} private void function () {value = Integer. parseInt (s. nextLine (); // enter a number from the console to test (; number <= value; number ++) {while (value % number = 0) {list. add (number); value = value/number ;}for (int I: list) {System. out. println (I );}}}
Input: 90
Output: 2
3
3
5