#include <iostream>
#include <cmath>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, first, last, len = 0;
cin >> n;
for (int i = 2; i <= sqrt(n); i++)
{
long long pre = 1;
for (int j = i; j * pre <= n; j++)
{
pre = pre * j;
if (n % pre == 0 && j - i + 1 > len)
{
len = j - i + 1;
first = i;
last = j;
}
}
}
if(len==0){//特判
cout<<1<<endl;
cout<<n<<endl;
}
else{
cout << len << endl;
for (int i = first; i <= last; i++)
{
cout << i;
if (i == last)
{
break;
}
cout << "*";
}
}
system("pause");
return 0;
}
连续因子序列
最新推荐文章于 2024-09-06 10:38:06 发布