codeforces 583C GCD Table

The GCD table G of size n × n for an array of positive integers a of length n is defined by formula

Let us remind you that the greatest common divisor (GCD) of two positive integers x and y is the greatest integer that is divisor of both x and y, it is denoted as . For example, for array a = {4, 3, 6, 2} of length 4 the GCD table will look as follows:

Given all the numbers of the GCD table G, restore array a.
Input

The first line contains number n (1 ≤ n ≤ 500) — the length of array a. The second line contains n2 space-separated numbers — the elements of the GCD table of G for array a.

All the numbers in the table are positive integers, not exceeding 109. Note that the elements are given in an arbitrary order. It is guaranteed that the set of the input data corresponds to some array a.
Output

In the single line print n positive integers — the elements of array a. If there are multiple possible solutions, you are allowed to print any of them.
Sample test(s)
Input

4
2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2

Output

4 3 6 2

Input

1
42

Output

42

Input

2
1 1 1 1

Output

1 1

题目大意：给出n个数，n个数两两gcd就可以得出一张gcd表。现在给你gcd表中的$n^2$个数，要你求出这n个数。

解题思路：gcd表中最大的数一定在这n个数中，那么先找到最大的数，在$n^2$个数中删除一个该数，然后这个数和已经找到的数进行gcd，在$n^2$个数中删除两个个当前gcd的结果，然后在剩下的数中再找最大的数，重复上面的操作。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <map>
using namespace std;

typedef long long ll;
int rec[1505];
int ans[1505];

int main() {
    int n;
    while (scanf("%d", &n) != EOF) {
        map<int, int> mp;
        memset(rec, 0, sizeof(rec));
        memset(ans, 0, sizeof(ans));    
        mp.clear();

        int a;
        int cnt = 0;
        int cnt2 = 0;
        for (int i = 0; i < n * n; i++) {
            scanf("%d", &a);    
            if (mp.count(a) == 0) {
                rec[cnt++] = a; 
                mp[a] = 1;
            } else mp[a]++; 
        }
        if (n == 1) {
            printf("%d\n", rec[0]); 
            continue;
        }
        sort(rec, rec + cnt);
        for (int i = cnt - 1; i >= 0; i--) {
            if (mp[rec[i]] <= 0) continue;
            while (mp[rec[i]] > 0) {
                ans[cnt2++] = rec[i];
                mp[rec[i]]--;
                for (int j = 0; j < cnt2; j++) {
                    int temp = __gcd(rec[i], ans[j]);   
                    mp[temp] -= 2;
                }
            }
        }
        sort(ans, ans + cnt2);
        printf("%d", ans[cnt2 - 1]);
        for (int i = cnt2 - 2; i >= 0; i--) {
            printf(" %d", ans[i]);  
        }puts("");
    }
    return 0;
}