1096. Consecutive Factors (20)

#include<cstdio>
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int maxn=0;
	vector <int> res,factor;
	for(int i=2;i<=(int)sqrt(n);i++)
	{
		int j=i,z=n,x=0;
		factor.clear();
		while(z%j==0)
		{
			z/=j;
			x++;
			factor.push_back(j);
			j++;
		}
		if(x>maxn)
		{
			maxn=x;
			res.clear();
			res=factor;
		}
	}
	if(maxn==0)
	{
		cout<<'1'<<endl;
		cout<<n<<endl;
		return 0;
	}
	cout<<maxn<<endl;
	for(int i=0;i<res.size();i++)
	{
		if(i) cout<<'*';
		cout<<res[i];
	}
	return 0;
}