PAT(甲) Consecutive Factors (20)

题目描述

Among all the factors of a positive integer N, there may exist several consecutive numbers.  For example, 630 can be factored as 3*5*6*7, where 5, 6, and 7 are the three consecutive numbers.  Now given any positive N, you are supposed to find the maximum number of consecutive factors, and list the smallest sequence of the consecutive factors.

输入描述:

Each input file contains one test case, which gives the integer N (1<n<231).

输出描述:

For each test case, print in the first line the maximum number of consecutive factors.  Then in the second line, print the smallest sequence of the consecutive factors in the format "factor[1]*factor[2]*...*factor[k]", where the factors are listed in increasing order, and 1 is NOT included.

输入例子:

630

输出例子:

3
5*6*7
此题的大意是求一个正整数的最长连续因数
package cn.jxau.arithmetic;

import java.util.Scanner;

/**
 * 最长连续因数
 * @author 编程只服JAVA
 *
 */
public class ConsecutiveFactors {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		scanner.close();
		
		int limit = (int) Math.sqrt(n);
		boolean flag = true;
		int start;
		int maxLen = 0;//最大长度
		int tempLen;//临时长度
		double temp;
		int s = 0;
		
		/**
		 * 利用循环不断尝试因数
		 * 相信利用动态规划的思想可以进一步优化
		 */
		for(int i = 2; i < limit; i++){
			if(n % i == 0)
				flag = false;
			
			start = i;
			tempLen = 0;
			temp = n;
			while(temp % start == 0){
				tempLen++;
				temp /= start;
				start++;
			}
			
			if (tempLen > maxLen) {
				maxLen = tempLen;
				s = i;
			}
		}
		
		if (flag) {
			System.out.println(1);
			System.out.println(n);
		}else {
			System.out.println(maxLen);
			System.out.print(s++);
			for(int i = 1;i<maxLen ;i++,s++)
				System.out.print("*"+s);
		}
	}
}