codeforces 977d

最新推荐文章于 2020-12-17 22:40:10 发布

anthony1314

最新推荐文章于 2020-12-17 22:40:10 发布

阅读量266

点赞数

分类专栏： ACM题目和算法 OJ----codeforces

本文链接：https://blog.csdn.net/anthony1314/article/details/80257609

版权

ACM题目和算法同时被 2 个专栏收录

131 篇文章 0 订阅

订阅专栏

OJ----codeforces

27 篇文章 0 订阅

订阅专栏

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

typedef long long ll;

const int N = 110;

int n;
int gt[N];
bool f[N];
ll a[N];

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i)
		scanf("%lld", &a[i]);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			if (a[i] / 3 == a[j] && a[i] % 3 == 0) {
				gt[i] = j;
				f[j] = true;
			} else if (a[i] * 2 == a[j]) {
				gt[i] = j;
				f[j] = true;
			}
	int t = 1;
	for (int i = 1; i <= n; ++i)
		if (!f[i])
			t = i;
	while (t) {
		printf("%lld ", a[t]);
		t = gt[t];
	}
	return 0;
}