codeforce 582-A GCD Table

A. GCD Table
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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

题意分析：该题其实是道贪心题，刚开始使用pair做发现超时了，后来用的set做的，其实做水题也是需要基本数据结构知识的。先分析一下解题思路，首先，将所给的n*n个数从大到小排序，前两个肯定是。接着就消去他们的最小公约数2个，再来选取次大的，在消去它与前面的数最小公约数，以此类推，直到没有数了。将所选取的数输出就行。

代码如下：

#include <iostream>
#include <cstdio>
#include <set>
#include <cstring>
#include <algorithm>

using namespace std;

multiset<int,greater<int> > s;
multiset<int,greater<int> >::iterator it;

int ans[550];

int gcd(int a,int b)
{
    return b?gcd(b,a%b):a;
}

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int len = n*n;
        for(int i=0;i<len;i++)
        {
            int num;
            scanf("%d",&num);
            s.insert(num);
        }
        int k = 0;
        while(!s.empty())
        {
            ans[k++] = *s.begin();
            s.erase(s.begin());
            for(int i=0;i<k-1;i++)
            {
                int tmp = gcd(ans[i],ans[k-1]);
                s.erase(s.find(tmp));
                s.erase(s.find(tmp));
            }
        }
        for(int i=0;i<n-1;i++)
            printf("%d ",ans[i]);
        printf("%d\n",ans[k-1]);
    }
    return 0;
}