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
题目意思是给你若干个数字(数字个数不确定),要求你求出任意两个数的最大公约数的最大值。
对于数字的分解可以有两种方法:
1:对于每组数据,通过循环,将一个个数字分解出来,并存入数组
2:将每组数据以字符串形式放入字符串流中并通过istringstream将字符串类型转化为int类型
对于最大公因数的求解 由于数据量不大,直接暴力循环判断即可
法一:
#include<iostream>
#include<cstring>
#include<stdio.h>
#include<cmath>
using namespace std;
int arr[1000];
int GCD(int a, int b) {
if(a < b) {
a = a + b;
b = a - b;
a = a - b;
}
int c = a % b;
while(c) {
a = b;
b = c;
c = a % b;
}
return b;
}
int main() {
int n,res,m,Len,tmp;
char str[10000];
scanf("%d",&n);
getchar();
while(n--){
m = 0;
gets(str);
Len = strlen(str);
tmp = 0;
for(int i = 0;i < Len;i++) {
tmp = 0;
while(str[i] != ' ' && str[i] != '\0') {
tmp = tmp * 10 + str[i++] - '0';
}
arr[m++] = tmp;
}
res = 0;
for(int i = 0;i < m;i++)
for(int j = i + 1;j < m;j++)
res = max(res,GCD(arr[i],arr[j]));
printf("%d\n",res);
}
return 0;
}
法二:
#include<iostream>
#include<cstring>
#include<stdio.h>
#include<sstream>
#include<string>
using namespace std;
int arr[1000];
int GCD(int a, int b) {
if(a < b) {
a = a + b;
b = a - b;
a = a - b;
}
int c = a % b;
while(c) {
a = b;
b = c;
c = a % b;
}
return b;
}
int main() {
int n,res,m,Len,tmp;
char str[10000];
scanf("%d",&n);
getchar();
while(n--){
m = 0;
gets(str); //读入一行
istringstream istr(str);//把str中的字符串存入字符串流中
int tmp;
while(istr >> tmp) { //以空格为界,把istringstream中的数据取出,并将其转化为int类型
arr[m++] = tmp;
}
res = 0;
for(int i = 0;i < m;i++)
for(int j = i + 1;j < m;j++)
res = max(res,GCD(arr[i],arr[j]));
printf("%d\n",res);
}
return 0;
}