Submission #1837393

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <queue>
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 int MAXN = 2007;
const LD EPS = 1e-7;

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

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

int main()
{
	ios_base::sync_with_stdio(0);
	//freopen("In.txt", "r", stdin);
	cin >> n;
	REP(i, n) cin >> A[i];
	REP(i, n)
	{
		if (used[i]) continue;
		used[i] = true;
		Q.push(i);
		int sz = 0;
		while (!Q.empty())
		{
			int v = Q.front();
			Q.pop();
			B[r][sz++] = A[v];
			REP(j, n)
			{
				if (!used[j] && gcd(A[v], A[j]) > 1)
				{
					used[j] = true;
					Q.push(j);
				}
			}
		}
		++r;
	}
	REP(i, r) P[i] = 0;
	REP(i, n)
	{
		int mr = 0;
		REP(j, r)
			if (B[j][P[j]] > B[mr][P[mr]])
				mr = j;
		cout << B[mr][P[mr]] << ' ';
		++P[mr];
	}
	//cout << endl; system("pause");
	return 0;
}

Submission Info

Judge Result