1096 Consecutive Factors-PAT甲级

 

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 (131).


 

输出描述:

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.

示例1

输入

630

输出

3
5*6*7

我采用的是暴力解法,遍历2-根号n范围内连续的数,截至根号n即可,后面不会有再比前面更多的连续数

第二个注意点在于质数,质数因子只有1和它本身,题目中明确1不在内,所以只需要输出n即可

满分代码如下:

#include<bits/stdc++.h>
using namespace std;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	int max_num=0,sum=0,v,i=2;
	for(;i<=(int)(sqrt(n*1.0));i++){
		sum=0;
		if(n%i==0){
			for(int j=i;n%j==0;j*=(i+sum)){
				sum++;
			}
			if(sum>max_num){
				max_num=sum;
				v=i;
			}
		}	
	}
	if(max_num==0){
		cout<<1<<endl;
		cout<<n;
	}else{
		cout<<max_num<<endl;
		int flag=1;
		for(int i=v,j=1;j<=max_num;i++,j++){
			if(!flag){
				cout<<'*';
			}
			cout<<i;
			flag=0;
		}
	}
	
	return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值