题解 | 最大公约数1
最大公约数1
https://www.nowcoder.com/practice/021010dda9f04900a86738931a5600a4
#include <stdio.h>
int gcd(int a,int b){
if(b==0) return a;
else return gcd(b,a%b);
}
int main() {
int n;
while(scanf("%d",&n)!=EOF){
int shu[1000000];
for(int i=0;i<n;i++){
scanf("%d",&shu[i]);
}
int max=shu[0];
int min=shu[0];
for(int i=1;i<n;i++){
if (max<shu[i]) max=shu[i];
if(min>shu[i]) min=shu[i];
}
printf("%d %d %d\n",min,max,gcd(max,min));
}
}
