uva11827——最大公约数+输入处理（stringstream)

题目链接：https://cn.vjudge.net/problem/UVA-11827

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

 

Output for Sample Input

20
1
25

题目翻译：

求出所有数每一对数的最大的最大公约数，输入时处理了一下，直接暴力就行了。

#include<iostream>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> a;
int main(){
	int T;
	scanf("%d\n",&T);
	while(T--){
		string line;
		getline(cin,line);
		stringstream ss(line);
		int x;
		a.clear();
		while(ss>>x)
			a.push_back(x);
		int len=a.size(),maxnn=-1;
		for(int i=0;i<len;i++)
			for(int j=i+1;j<len;j++)
				maxnn=max(maxnn,__gcd(a[i],a[j]));
		printf("%d\n",maxnn);
	}
	return 0;
}