PAT 甲级 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.

输入描述:

Each input file contains one test case, which gives the integer N (1

输出描述:

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.

输入例子:

630

输出例子:

3
5*6*7

代码如下，虽然题目很简单，仍然需要注意变量初始化的问题，尤其是start变量和input_num变量在每次循环后都应保持不变，应该可用static关键字修饰，具体就没有尝试了。

//
//  main.cpp
//  Consective_factors
//
//  Created by Hui Du on 2017/9/13.
//  Copyright © 2017年 Hui Du. All rights reserved.
//

#include <iostream>
#include <math.h>

using namespace std;


int main(int argc, const char * argv[]) {
    int input_num,factor_len,
    actual_len,input_sq = 0, start;

    while(cin >> input_num){
        actual_len =0;
        start = 0;
        int save_input = input_num;
        input_sq = sqrt(input_num);
        for(int i = 2; i <= input_sq; i++){
            input_num = save_input;
            factor_len = 0;
                while(input_num % (i+factor_len) == 0){
                    input_num = input_num/(i+factor_len++);
                }
                if (factor_len > actual_len) {
                    start = i;
                    actual_len = factor_len;
                }
        }
        if(actual_len == 0){
            start = input_num;
            actual_len = 1;
        }
        cout << actual_len << "\n";
        for(int j = start; j < actual_len + start; j++){
            cout << j;
            if (j != actual_len + start -1) {
                cout<< "*";
            }
        }
        cout << "\n";
    }
    return 0;
}