Codeforces 583C/582A 暴力+gcd

A. GCD Table
time limit per test 2 seconds
memory limit per test 256 megabytes
input standard input
output standard 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 xand 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
题意是给出一个打乱了顺序的GCD表，里面是任意两个A[I]的GCD。求A数组。
首先这个表中的最大元素肯定是数组元素（想想就知道），然后与其他在数组中的元素求GCD，将结果从表中删除，然后再找最大元素，肯定是数组。
但是用Pas没办法直接存储10^9这么大的数字。。我很天真的打了个10^7的，以为会给个五六十分，结果只有20，一怒之下怒弃pas转c艹。
代码（c艹）：

#include <iostream>    
#include <algorithm>    
#include <cmath>     
#include <string>    
#include <cstring>  
#include <queue>  
#include <map>  
#include <cstdio>
using namespace std;  
typedef long long ll;  

int n;  
int a[2500005];  
int ans[3000000];  
map<int, int>b;  

int gcd(int a, int b)  
{  
    if (a==0)  
    {  
        return b;  
    }  
    return gcd(b%a, a);  
}  

int main()  
{  
    int i,j,k;  
    scanf("%d", &n); 
    int n2=n*n;
    for (i=1;i<=n2;i++)  
    {  
        scanf("%d", &a[i]);  
        b[a[i]]++;  
    } 
    sort(a+1,a+n2+1);  
    int tail=0;
    for (i=n2;i>=1;i--)  
    {
        if (b[a[i]]==0)continue;  
        b[a[i]]--;  
        for (j=0;j<tail;j++)  
        {  
            int t=gcd(a[i],ans[j]);  
            b[t]=b[t]-2;  
        }  
        ans[tail]=a[i];
        tail++;  
    }  
    for (i=0;i<tail;i++)  
    {  
        printf("%d ",ans[i]);  
    }  
    return 0;  
}  

还有pas的（不是我的方法）：

const   maxn=1000005;
var n,i,j,k,g,tot:longint;
    a,tax,dt,b2:array[0..maxn] of longint;
procedure qsort(x,y:longint);
var     k,i,j,t:longint;
begin
    i:=x;
    j:=y;
    k:=a[(x+y) shr 1];
    repeat
        while a[i]>k do inc(i);
        while a[j]<k do dec(j);
        if i<=j then begin
            t:=a[i];
            a[i]:=a[j];
            a[j]:=t;
            inc(i);dec(j);
        end;
    until i>j;
    if i<y then qsort(i,y);
    if j>x then qsort(x,j);
end;
function find(x:longint):longint;
var     l,r,mid:longint;
begin
    l:=1;
    r:=tot;
    while l<r do begin
        mid:=(l+r) shr 1;
        if dt[mid]<x then r:=mid-1 else
        if dt[mid]>x then l:=mid+1 else exit(mid);
    end;
    exit(l);
end;
function gcd(x,y:longint):longint;
begin
        if y=0 then exit(x) else
        exit(gcd(y,x mod y));
end;
begin
    readln(n);
    for i:=1 to n*n do read(a[i]);
    qsort(1,n*n);
    for i:=1 to n*n do begin
        if a[i]<>a[i-1] then begin
            inc(tot);
            dt[tot]:=a[i];
        end;
        inc(tax[tot]);
    end;
    i:=1;
    k:=0;
    while i<=tot do begin
        inc(k);
                b2[k]:=i;
        write(dt[i],' ');
        for j:=1 to k-1 do
            dec(tax[find(gcd(dt[b2[j]],dt[i]))],2);
                dec(tax[i]);
        while (tax[i]=0) and (i<=tot) do inc(i);
    end;

end.