【数论】Prime Time （strtok函数用法）

 

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 

【题解】：

意思是在一组数里面找出一对最大的GCD。

暴力两个for即可，数论只会GCD。。。

然而我写这篇博客主要是因为；

strtok函数用法

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
typedef long long ll;
int gcd(int a,int b){
    return a%b==0?b:gcd(b,a%b);
}
int main()
{
    int T;
    scanf("%d",&T);
    getchar();
    char str[100005];
    while(T--){
        int a[1000],n=0;
        cin.getline(str,sizeof(str));
        //fgets(str,sizeof(str),stdin);
        char tt[]=" ";
        char *ptr;
        ptr=strtok(str,tt);
        while(ptr!=NULL){
            sscanf(ptr,"%d",&a[n++]);
            //printf("%s\n",ptr);
            ptr=strtok(NULL,tt);
        }
        int tmp=-1;
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if(i==j)    continue;
                tmp=max(tmp,gcd(a[i],a[j]));
            }
        }
        printf("%d\n",tmp);
    }
    return 0;
}