Given the N integers, you have to find the maximum GCD (greatest common divisor) of every possible pair of these integers.
Input
The first line of input is an integer N (1 < N < 100) that determines the number of test cases. The following N lines are the N test cases. Each test case contains M (1 < M < 100) positive integers that you have to find the maximum of GCD.
Output
For each test case show the maximum GCD of every possible pair.
Sample Input
3
10 20 30 40
7 5 12
125 15 25
Sample Output
20
1
25
直接暴力两个两个求LCM,取最大值!
麻烦是输入:用ungetc函数进行读取
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
int g[111];
int gcd(int a,int b){
return b == 0 ? a : gcd(b,a%b);
}
int main()
{
int _;scanf("%d",&_);
while(getchar()!='\n');
while(_--){
int n=0;
char ch;
while((ch = getchar()) != '\n')
if(ch>='0'&&ch<='9'){
ungetc(ch,stdin);//这里将输入的数字字符进行退流,但遇到一个非数字时就输入到g数组中
scanf("%d",&g[n++]);
}
int maxn=1;
for(int i=0;i<n-1;i++)
for(int j=i+1;j<n;j++)
maxn = max(maxn,gcd(g[i],g[j]));
printf("%d\n",maxn);
}
return 0;
}