Codeforces Round #323 (Div. 2)C. GCD Table

最新推荐文章于 2015-12-24 18:22:45 发布

zhaohuc

最新推荐文章于 2015-12-24 18:22:45 发布

阅读量504

点赞数

分类专栏：贪心 codeforces 文章标签： codeforces

本文链接：https://blog.csdn.net/ZZ_AC/article/details/48922185

版权

codeforces 同时被 2 个专栏收录

42 篇文章 0 订阅

订阅专栏

贪心

3 篇文章 0 订阅

订阅专栏

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

$\text{[math]}$

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 $\text{[math]}$ . For example, for array a = {4, 3, 6, 2} of length 4 the GCD table will look as follows:

$\text{[math]}$

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为止。

详见代码

参考:Codeforces Round #323 Editorial

#include
        
        
         
         
#include
         
         
          
          
#include
          
          
           
           
#include
           
           
            
            
#include
            
             using namespace std; const int N = 555; int b[N]; int gcd(int x, int y) { if(!y) return x; return gcd(y, x%y); } map 
             
               g; int main(void) { int n; while(~scanf("%d", &n)) { g.clear(); int i, j, k; int x; for(i = 0; i < n*n; i++) { scanf("%d", &x); g[x]++; } int num = n*n; map 
              
                ::iterator iter; for(i = 1; i <= n; i++) { int MAX = 0; for(iter = g.begin(); iter != g.end(); iter++) { if(iter->second && iter->first > MAX) MAX = iter->first; } b[i] = MAX; for(j = 1; j < i; j++) { int tmp = gcd(b[i], b[j]); g[tmp] -= 2; } g[MAX]--; } for(i = 1; i < n; i++) printf("%d ", b[i]); printf("%d\n", b[n]); } return 0; }