Codeforces 583C GCD Table 【gcd + 构造】

最新推荐文章于 2018-08-05 13:25:09 发布

原创最新推荐文章于 2018-08-05 13:25:09 发布 · 698 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

codeforces

gcd && lcm && exgcd && CRT

构造

本文介绍了解决Codeforces GCDTable问题的方法。通过分析给出的n*n个无序数，找出由n个数两两组成的最大公约数(GCD)，并还原出原始的整数数组。提供了一种有效算法，利用非降序排列特性逐步确定数组元素。

题目链接：Codeforces 583C GCD Table

C. 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.

Examples
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个无序的数，这些数是由n个数两两的gcd组成。让你找到这n个数。

思路：假设这n个数为a[1]，a[2]，…，a[n]且是非降序排列的。
那么n*n里面最大的数一定是a[n]，找到a[n]后去掉gcd(a[n], a[n])。同理找到a[n-1]，去掉gcd(a[n-1], a[n])、gcd(a[n-1], a[n-1])……这样找完n个数就可以了。

AC代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <queue>
#define CLR(a, b) memset(a, (b), sizeof(a))
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 3*1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
int gcd(int a, int b) {
    return b == 0 ? a : gcd(b, a % b);
}
map<int, int> fp;
int a[MAXN];
int ans[600];
int main()
{
    int n;
    while(scanf("%d", &n) != EOF) {
        fp.clear();
        for(int i = 1; i <= n*n; i++) {
            scanf("%d", &a[i]);
            fp[a[i]]++;
        }
        sort(a+1, a+n*n+1); int top = 0;
        for(int i = n*n; i >= 1; i--) {
            if(fp[a[i]] == 0) continue;
            //cout << a[i] << endl;
            ans[top++] = a[i]; fp[a[i]] -= 1;
            for(int j = 0; j < top-1; j++) {
                fp[gcd(ans[j], a[i])] -= 2;
            }
        }
        for(int i = 0; i < top; i++) {
            if(i) printf(" ");
            printf("%d", ans[i]);
        }
        printf("\n");
    }
    return 0;
}