CF582A GCD Table
来源:互联网 发布:军人网络泄密心得体会 编辑:程序博客网 时间:2024/06/05 03:02
题目链接:http://codeforces.com/problemset/problem/582/A
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 bothx 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.
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
解题思路:在所有的数组成的集合中,最大的数一定为n个数中的一个,把这个数从集合中减去一个,并把这个数加入数组b中,然后找出第二大的数,将这个数与数组b中的数的最大公因数从集合中减去两个,再把这个数加入数组b中,接着重复上述步骤,找出第三,第四.....第n个数,数组b中的数即为答案。
#include <cstdio>#include <cstring>#include <map>#include <algorithm>using namespace std;#define N 250010int a[N],num[N],b[N];map<int,int>mp;int n,tot,x;int main(){ scanf("%d",&n); for(int i=1;i<=n*n;++i) scanf("%d",&b[i]); mp.clear(); sort(b+1,b+n*n+1); tot=0; for(int i=1;i<=n*n;++i) { x=b[i]; if(mp.find(x)==mp.end()) { mp[x]=++tot; a[tot]=x; num[tot]=1; } else ++num[mp[x]]; } int z=1; b[1]=a[tot]; printf("%d ",a[tot]); --num[tot]; for(int i=tot;i>0;--i) { while(num[i]>0) { b[++z]=a[i]; --num[i]; printf("%d ",a[i]); for(int j=1;j<z;++j) num[mp[__gcd(b[z],b[j])]]-=2; } } return 0;}
- CF582A GCD Table
- CF582A给出n个数的相互GCD,求这n个数,map的使用
- cf583C. GCD Table
- Codeforces 583C GCD Table 【gcd + 构造】
- cf 582A GCD Table
- Codeforces 583c GCD Table
- codeforce 582-A GCD Table
- Codeforces 582A GCD Table
- codeforces 582A GCD Table
- codeforces 583C GCD Table
- 贪心+map Codeforces583C GCD Table
- codeforce 582 A. GCD Table
- Codeforces 582A:GCD Table
- codeforces 338D GCD Table
- codeforces 338D GCD Table
- codeforces 582A GCD Table
- CF#323-DIV2-C - GCD Table - 贪心GCD
- CF 338 D GCD Table(CRT)
- hdu1181 变形课
- 基于源代码的增强
- CLR
- Debian 8.0下为ThinkPad R52降低风扇转速
- xcode7 “Application Transport Security has blocked a cleartext HTTP (http://) resource ”的解决
- CF582A GCD Table
- Android兼容性问题 -- 设置圆角背景方向相反问题
- 韩顺平Linux笔记(七)——Linux安装
- 代理模式 与装饰模式的区别 干货
- nyoj--74--小学生算术(水)
- 随意细解:UI -- UIView及其子类
- 小技巧9-iOS UITextField结束编辑、收回键盘
- lightoj1297(二分查找,或求导)
- Android使用兰贝壳儿实现多渠道打包