Code hoof collection of wonderful secret place

subject ： The adventure group is exploring in a wonderful secret place , In front of us is the secret place reward level , The checkpoint mechanism is as follows ： Random given M Gold coin , If you can find three that are not greater than M The integer of （ Can be the same ）,  Find their least common multiple S, Then the adventure group can get S Gold coins , In order to get the most gold coins , It is unanimously decided that you, the team think tank, will be entrusted with the task , Find out S The maximum of .

Format ：

Input format ： Enter a positive integer n

Output format ： Output the least common multiple of the three numbers in the question S The maximum of

Examples ：

 Input  ：10
 Output  ：630

#include<bits/stdc++.h>

using namespace std;

int main(){
	long long int n;
	vector<long long int> arr;
	vector<long long int> arr2;
	long long int temp, c, d;
	long long int min,min2;
	bool flag;
	cin >> n;
	
	if(n > 2) {
		arr.insert(arr.end(),n);
		arr.insert(arr.end(), n-1);
		arr.insert(arr.end(),n-2);
		
		sort(arr.begin(), arr.end());
		
		while(arr.size()>1){
			c = arr[0];
			d = arr[1];
			min = c*d;
			
	//		cout << min << endl;      The two elements are the same  
			temp = c%d;
			while(temp){
				c = d;
				d = temp;
				temp = c%d;
			}
	
			min = min/d;
			
			arr.erase(arr.begin(),arr.begin()+2);
			arr.insert(arr.begin(),min);	
		}
		
		if(n-3>0){
			flag = 1;
			arr2.insert(arr2.end(),n);
			arr2.insert(arr2.end(), n-1);
			arr2.insert(arr2.end(),n-3);
			sort(arr2.begin(),arr2.end());
			
			while(arr2.size()>1){
				c = arr2[0];
				d = arr2[1];
				min2 = c*d;
				temp = c%d;
	//			for(int i=0;i<arr2.size();i++){
	//			cout << arr2[i] << endl;
	//		}
				while(temp){
					c = d;
					d = temp;
					temp = c%d;
				}
				
				min2 = min2/d;
				arr2.erase(arr2.begin(),arr2.begin()+2);
				arr2.insert(arr2.begin(),min2);
			}	
		}
		
		if(flag){
			if(min2 > min) {
				min = min2;
				
			}
		}
		
	}
	else{
		if(n==2){
			min = 4;
		}
		else{
			min =1;
		}
	}
	
	cout << min;
	return 0;
}