백준 1037 c++

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int input(int lower, int upper);
void input_divisor(vector <int>& divisor, int num);
void sort_vector(vector <int>& divisor);
int find_LCM(vector <int> divisor);

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int A, N;
	vector <int> divisor;

	N = input(1, 50);
	input_divisor(divisor, N);
	sort_vector(divisor);
	cout << find_LCM(divisor) << "\n";

	return 0;
}

int input(int lower, int upper)
{
	//cout << "input()" << endl;
	int A;

	while (1)
	{
		cin >> A;
		if (A >= lower && A <= upper)
		{
			break;
		}
		else
		{
			;
		}
	}

	return A;
}

void input_divisor(vector <int>& divisor, int num)
{
	//cout << "input_divisor()" << endl;
	int i, A;

	for(i = 0; i < num; i++)
	{
		A = input(2, 1000000);
		divisor.push_back(A);
	}

	return;
}

//주어진 수들 중 최솟값과 최댓값을 찾아서 곱하기?
void sort_vector(vector <int>& divisor)
{
	//cout << "sort_vector()" << endl;
	sort(divisor.begin(), divisor.end());

	return;
}

int find_LCM(vector <int> divisor)
{
	//cout << "find_LCM()" << endl;
	int LCM;

	LCM = divisor.front() * divisor.back();

	return LCM;
}