1096 Consecutive Factors

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
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <sstream>
#include <string.h>

using namespace std;

typedef long long ll;

struct l
{
    ll head=0;
    ll len=0;
} line;
int main()
{
    int n;
    cin>>n;
    for(int i=2; i<=sqrt(n); i++)
    {
        ll sum = i;
        int len=0;
        while(n%sum==0)
        {
            len++;
            sum=sum*(i+len);
        }
        if(len>line.len)
        {
            line.head=i;
            line.len=len;
            continue;
        }
        if(len==line.len&&line.head>i)
        {
            line.head=i;
        }
    }
    if(line.len==0)
    {
        line.head=n;
        line.len=1;
    }
    cout<<line.len<<endl;
    for(int i=0; i<line.len; i++)
    {
        if(i==0)
            cout<<line.head;
        else
            cout<<"*"<<line.head+i;
    }
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值