Submission #1841384

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
#include <string.h>
#include <set>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;

typedef double LD;
typedef long long LL;
typedef pair<int, int> PII;
#define MP make_pair
#define PB push_back
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); --i)
#define REP(i, t) FOR(i,0,t)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())

const LL MOD = 1000000007;
const int INF = 1e9;
const LL LINF = 1LL * INF * INF;
const int MAXN = 2007;
const LD EPS = 1e-7;

int n, A[MAXN], r = 0, P[MAXN];
bool used[MAXN];
vector <int> B[MAXN];
bool G[MAXN][MAXN];

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

void dfs(int v)
{
	used[v] = true;
	if (!B[r].empty() && !G[v][B[r][SZ(B[r]) - 1]])
		++r;
	B[r].push_back(v);
	REP(i, n)
	{
		if (G[v][i] && !used[i])
			dfs(i);
	}
	
}

int main()
{
	ios_base::sync_with_stdio(0);
	//freopen("In.txt", "r", stdin);
	cin >> n;
	REP(i, n) cin >> A[i];
	sort(A, A + n);
	REP(i, n)
	{
		REP(j, i)
		if (gcd(A[i], A[j]) > 1)
			G[i][j] = G[j][i] = true;
	}
	REP(i, n)
		if (!used[i])
			dfs(i);
	REP(i, n)
	{
		int m = 0, curr;
		REP(j, r + 1)
		{
			if (P[j] < SZ(B[j]) && A[B[j][P[j]]] > m)
			{
				m = A[B[j][P[j]]];
				curr = j;
			}
		}
		cout << m << ' ';
		++P[curr];
	}
	//cout << endl; system("pause");
	return 0;
}

Submission Info

Judge Result