Codeforces 582A GCD Table
来源:互联网 发布:消费宝集团 知乎 编辑:程序博客网 时间:2024/04/27 18:08
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.
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.
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.
42 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2
4 3 6 2
142
42
21 1 1 1
1 1
解题思路:从大到小依次求解
#include <ctime>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <string>#include <vector>#include <map>#include <algorithm>using namespace std;int ans[1010];map<int, int> m;int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y);}int main() { //freopen("aa.in", "r", stdin); int n, x; m.clear(); scanf("%d", &n); for(int i = 1; i <= n*n; ++i) { scanf("%d", &x); m[x]++; } int cnt = 0; for(map<int, int>::reverse_iterator it = m.rbegin(); it != m.rend(); ++it) { if(it->second == 0) continue; while(it->second > 0) { ans[cnt] = it->first; it->second--; for(int j = 0; j < cnt; ++j) { int d = gcd(ans[j], it->first); m[d] -= 2; } cnt++; } } printf("%d", ans[0]); for(int i = 1; i < cnt; ++i) { printf(" %d", ans[i]); } printf("\n"); return 0;}
- Codeforces 582A GCD Table
- codeforces 582A GCD Table
- Codeforces 582A:GCD Table
- codeforces 582A GCD Table
- CodeForces - 582A GCD Table (map大数操作&gcd)好题
- cf 582A GCD Table
- codeforce 582-A GCD Table
- codeforce 582 A. GCD Table
- Codeforces Round #323 (Div. 1) A. GCD Table stl应用
- CF 582A(GCD Table-贪心)
- Codeforces 583C GCD Table 【gcd + 构造】
- Codeforces 583c GCD Table
- codeforces 583C GCD Table
- codeforces 338D GCD Table
- codeforces 338D GCD Table
- Codeforces 583C/582A 暴力+gcd
- Code Forces 582 A. GCD Table(数论)
- CodeForces 359A Table
- Packing Information into Names 2
- UIPopoverController的简单使用
- java运算符
- 删除链表中倒数第n个节点
- Foundation框架之NSArray
- Codeforces 582A GCD Table
- java递归获取文件列表和File的应用
- C/C++递归之汉诺塔求解
- 【中国是发达国家的粉碎机?】深度好文
- Java笔记---GUI( 图形用户界面)
- html中input标签回车事件分享
- 叭叭买车张珺:越苦逼的重度运营,壁垒越高(校正版)
- Objective-C---7---NSDate Protocol Category
- c++享元模式