백준/백준-C++
1037번: 약수
Beabletoet
2017. 9. 2. 20:11
1 2 3 4 5 6 7 8 9 10 11 | #include<cstdio> #include<algorithm> using namespace std; int main() { int n, num[50]; scanf("%d", &n); for (int i = 0; i < n; scanf("%d", &num[i++])); sort(&num[0], &num[n]); printf("%d", num[0] * num[n - 1]); } | cs |