中科大上機題——找最大最小數和最大公約數
題目描述:
最大公約數:輸入n個數,求出這n個數的最小值,最大值以及他們的最大公約數。
Sample Input:
3
4 6 8
Sample Output:
4 8 4
算法思路:
最大公約數用輾轉相除法求
#include<iostream>
using namespace std;
//找到最小數
int findMin(int num[], int n) {
int min = num[0];
for (int i = 1;i < n;i++) {
if (num[i] < min) {
min = num[i];
}
}
return min;
}
//找到最大數
int findMax(int num[], int n) {
int max = num[0];
for (int i = 1;i < n;i++) {
if (num[i] > max) {
max = num[i];
}
}
return max;
}
//輾轉相除法找到最大公約數
int function1(int a, int b) {
if (a < b) {
int temp;
temp = a;a = b;b = temp;
}
int i;
while (a % b) {
i = a % b;
a = b;
b = i;
}
return b;
}
//找到最小公倍數
int function2(int a, int b) {
return a * b / function1(a, b);
}
int main() {
int n;
cout << "輸入數字個數:";
cin >> n;
int* num = new int[n];
cout << "輸入數字:";
for (int i = 0;i < n;i++)
cin >> num[i];
int min = findMin(num, n);
int max = findMax(num, n);
cout << "最小值爲:" << min << endl;
cout << "最大值爲:" << max << endl;
cout << "最大公約數爲:" << function1(min, max) << endl;
cout << "最小公倍數爲:" << function2(min, max) << endl;
return 0;
}
運行測試結果: