View Code of Problem 91

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int k = 2;
		int temp = n;
		int a[] = new int[1000];
		int count = 0;
		while (temp != 1) {
			if (temp % k == 0) {
				a[count] = k;
				count++;
				temp = temp / k;
				k = 2;
			} else {
				k++;
			}
		}
		StringBuilder stringBuilder = new StringBuilder();
		stringBuilder.append(n).append("=");

		for (int i = 0; i < count - 1; i++) {
			stringBuilder.append(a[i]).append("*");
		}
		stringBuilder.append(a[count-1]);
		System.out.println(stringBuilder);
	}

	public static boolean zhishu(int number) {
		boolean flag = true;
		for (int i = 2; i <= Math.sqrt(number); i++) {
			if (number / i == 0) {
				flag = false;
			}
		}
		return flag;
	}
}