Group programming ladder race - exercise set l1-006 continuity factor

Topic link

characteristic ： Slightly improved the comrade's code

#include<iostream>
#include<vector>
#include<cmath>
typedef long long ll;
using namespace std;
int main() {
    
	int n;
	vector<int> ans;
	vector<int> temp_;
	cin >> n;
	int lim = sqrt(n);		// The factor of the input number will not exceed its root 
	for (int i = 2; i <= lim; i++) {
    
		ll temp = 1;
		for (int j = 0; j < 12; j++) {
    			//13 The factorial of exceeds int The maximum of （2^31）, Therefore, the maximum length will not exceed 12
			temp *= (i + j);
			if (temp > n)
				break;
			if (n % temp == 0) {
    
				temp_.push_back(i + j);
			}
			else
				break;
		}
		if (temp_.size() > ans.size()) {
    
			ans.assign(temp_.begin(), temp_.end());
		}
		temp_.clear();
	}
	if (ans.empty()) {
    	// Special judgment prevents segment transcendence 
		cout << 1 << endl << n;
		return 0;
	}
	cout << ans.size() << endl;
	if (ans.size() == 1)
		cout << ans[0];
	else {
    
		for (int i = 0; i < ans.size() - 1; i++)
			cout << ans[i] << "*";
		cout << ans[ans.size() - 1];
	}
	return 0;
}