Submission #1102224

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make_tuple

using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vd=vector<double>;
using vvd=vector<vd>;
using vs=vector<string>;

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
	return os<<'('<<p.first<<','<<p.second<<')';
}

template<typename Tuple>
void print_tuple(ostream&,const Tuple&){}
template<typename Car,typename... Cdr,typename Tuple>
void print_tuple(ostream& os,const Tuple& t){
	print_tuple<Cdr...>(os,t);
	os<<(sizeof...(Cdr)?",":"")<<get<sizeof...(Cdr)>(t);
}
template<typename... Args>
ostream& operator<<(ostream& os,const tuple<Args...>& t){
	print_tuple<Args...>(os<<'(',t);
	return os<<')';
}

template<typename Ch,typename Tr,typename C>
basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){
	os<<'[';
	for(auto i=begin(c);i!=end(c);++i)
		os<<(i==begin(c)?"":" ")<<*i;
	return os<<']';
}

constexpr int INF=1e9;
constexpr int MOD=1e9+7;
constexpr double EPS=1e-9;

vi merge(const vi& a,const vi& us,const vi& vs)
{
	vi res;
	int i=0,j=0;
	while(i<us.size()&&j<vs.size())
		res.push_back(a[us[i]]>=a[vs[j]]?us[i++]:vs[j++]);
	res.insert(end(res),i+all(us));
	res.insert(end(res),j+all(vs));
	return res;
}

vi dfs(const vvi& g,const vi& a,int u,vi& vis)
{
	vis[u]=1;
	vi res;
	for(int v:g[u]) if(!vis[v])
		res=merge(a,res,dfs(g,a,v,vis));
	res.insert(begin(res),u);
	return res;
}

int main()
{
	for(int n;cin>>n&&n;){
		vi a(n);
		rep(i,n) cin>>a[i];
		sort(all(a));
		vvi g(n);
		rep(i,n) repi(j,i+1,n) if(__gcd(a[i],a[j])!=1){
			g[i].push_back(j);
			g[j].push_back(i);
		}
		vi vis(n),res;
		rep(i,n) if(!vis[i])
			res=merge(a,res,dfs(g,a,i,vis));
		rep(i,n) cout<<a[res[i]]<<" \n"[i==n-1];
	}
}

Submission Info

Judge Result