[PTA] l1-006 continuity factor

Original link

L1-006 Continuous factor

ac Code

Pay attention to the error prone points and optimization methods in the notes

#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
using namespace std;
int main() {
    
	int n;
	cin >> n;

	int len = 0, st = 0;
	for(int i = 2; i <= sqrt(n); i++) {
    //sqrt(n) Then there can be no continuity factor 
		int temp = n;
		if(!(temp % i)) {
    
			int templ = 0, tempst = i;
			int t = i;// Because it's a grouping factor , So it's possible to remove the front , Add the back , More cases of continuity factors , use t temporarily replace i 
			while(!(temp % t)) {
    // Here, the continuous factor does not refer to the divisible factor used , But in groups 
				temp /= t++;
				templ++;
			}
			if(templ > len) {
    
				len = templ;
				st = tempst;
			}
		}
	}


	if(len) {
    
		cout << len << endl;
		for(int i = st; i < st + len - 1; i++) {
    
			cout << i << '*';
		}
		cout << st + len - 1;
	}else{
    
		cout << 1 << endl << n;// Prime cannot find intermediate factor , Previous searches will not record , Number of individual outputs 1 And it itself  
	}
	return 0;
}