【团体天梯赛/PTA】7-51 Consecutive Factors (20 分)

最新推荐文章于 2025-02-19 18:29:33 发布

原创最新推荐文章于 2025-02-19 18:29:33 发布 · 387 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #团体天梯赛

团体天梯赛专栏收录该内容

18 篇文章

订阅专栏

该博客介绍了如何使用C++解决一道名为'Consecutive Factors'的团体天梯赛编程题目。题目要求找出一个整数N的最大连续因子数及其序列。当N为素数时，输出N本身；否则，从2开始遍历到sqrt(N)，找出连续因子序列。样例输入630，输出3，因子序列5*6*7。

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

【团体天梯赛】7-51 Consecutive Factors (20 分)

【团体天梯赛】7-51 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.

Input Specification:

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

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:

$630$

Sample Output:

$3$
$5 * 6 * 7$

解题思路：

如果N为素数,则最长连续因子序列长度为1,只有N本身和1为因子,只需输出N。
如果N不为素数,因为根号N到N之间没有因子,则从i=2开始遍历到i=sqrt(n),暴力获得N的最长连续因子。
注意到N的范围为(1,2^31）,因为int的最大值为2 ^31，故需要用long来记录N和最长因子序列最大值。

#include<iostream>
using namespace std;
int main()
{
	long long N;int start=0;//输入N,max为序列最大值
	cin>>N;
	int num=0,sum=0;//记录连续因子长度
	for(long long i=2;i*i<=N;++i)
	{
		if(N%i!=0) continue;//如果不是因子，跳过
		else
		{
			sum=0;//每次重置长度 
			long long temp=N;//temp记录N的值，防止N变化 
			long long j=i;//求连续因子 
			while(temp%j==0)
			{
				temp/=j;
				sum++;
				j++;
			}
			//更新数值
			if(num<sum)
			{
				start=i; //最大值 
				num=sum;//最大长度 
			} 
		} 
	}
	 if(num==0) cout<<1<<endl<<N<<endl;//num为0，N为素数
	  else 
	  {
	  	cout<<num<<endl;
	  	for(int i=0;i<num;++i)
		  {
	  		if(i==num-1) cout<<start+i;
	  		else cout<<start+i<<"*";
	  	  }
	  }
	  return 0;
}