PAT 1096. Consecutive Factors

最新推荐文章于 2019-11-16 16:28:45 发布

solin205

最新推荐文章于 2019-11-16 16:28:45 发布

阅读量701

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.csdn.net/solin205/article/details/44565461

PAT 专栏收录该内容

23 篇文章

订阅专栏

给定一个正整数N，本博客旨在找到其最大的连续因子序列，并列出最小的连续因子序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Input Specification:

Each input file contains one test case, which gives the integer N (1<N<2³¹).

Output Specification:

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.

Sample Input:

Sample Output:

3
5*6*7

思路：2³¹ 最多是13个数相乘，所以从2开始遍历最长连续整数乘积是否能被N正除，即可

#include <stdio.h>
#include <math.h>
int N;
int main()
{
	while(scanf("%d", &N) != EOF)
	{
		int temp = N, a = sqrt((double)N), max = 0, cnt = 0, tr, res = N;
		for(int i = 2; i <= a; i++)
		{
			temp = N;
			cnt = 0;
			for(int j = i; j <= i + 13; j++)
			{
				if(temp % j == 0)
				{
					temp /= j;
					cnt++;
					tr = j;
				}
				else
				{
					break;
				}
			}
			if(cnt > max)
			{
				res = tr;
				max = cnt;
			}
		}
		if(max == 0)
		{
			max = 1;
		}
		res = res - max + 1;
		printf("%d\n", max);
		for(int i = 0; i < max - 1; i++)
		{
			printf("%d*", res);
			res++;
		}
		printf("%d\n", res);
	}
	return 0;
}