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 | Output for Sample Input |
3 10 20 30 40 7 5 12 125 15 25 | 20 1 25 |
题目意思就是求给出这一行数的最大公约数;
因为给的一行数的个数不知道所以输入的时候要用字符输入,然后取出来数,再挨个遍历
用辗转相除法求出最大公约数即可;
代码
#include<stdio.h>
#include<string.h>
int main()
{
int N;
char s[100000];
int t[100000];
scanf("%d",&N);
getchar();
while(N--)
{
int i,j,k;
int n,m=0,sum=0;
gets(s); //输入数字
n=strlen(s);
for(i=0; i<n; i++)
{
if(s[i]!=' ')
sum=sum*10+s[i]-'0';
if(s[i]==' '||i==n-1) //分开数字
{
t[m]=sum;
sum=0;
m++;
}
}
int x,y,max=-1,f;
for(i=0; i<m; i++)
for(j=i+1; j<m; j++)
{
if(t[i]>t[j])
{
x=t[i];
y=t[j];
}
else
{
x=t[j];
y=t[i];
}
while(y!=0) //辗转相除法求最大公约数
{
f=x%y;
x=y;
y=f;
}
if(x>max)
max=x;
}
printf("%d\n",max);
}
return 0;
}