Polycarp likes to play with numbers. He takes some integer number xx, writes it down on the board, and then performs with it n−1n−1operations of the two kinds:
- divide the number xx by 33 (xx must be divisible by 33);
- multiply the number xx by 22.
After each operation, Polycarp writes down the result on the board and replaces xx by the result. So there will be nn numbers on the board after all.
You are given a sequence of length nn — the numbers that Polycarp wrote down. This sequence is given in arbitrary order, i.e. the order of the sequence can mismatch the order of the numbers written on the board.
Your problem is to rearrange (reorder) elements of this sequence in such a way that it can match possible Polycarp's game in the order of the numbers written on the board. I.e. each next number will be exactly two times of the previous number or exactly one third of previous number.
It is guaranteed that the answer exists.
The first line of the input contatins an integer number nn (2≤n≤1002≤n≤100) — the number of the elements in the sequence. The second line of the input contains nn integer numbers a1,a2,…,ana1,a2,…,an (1≤ai≤3⋅10181≤ai≤3⋅1018) — rearranged (reordered) sequence that Polycarp can wrote down on the board.
Print nn integer numbers — rearranged (reordered) input sequence that can be the sequence that Polycarp could write down on the board.
It is guaranteed that the answer exists.
6 4 8 6 3 12 9
9 3 6 12 4 8
4 42 28 84 126
126 42 84 28
2 1000000000000000000 3000000000000000000
3000000000000000000 1000000000000000000
In the first example the given sequence can be rearranged in the following way: [9,3,6,12,4,8][9,3,6,12,4,8]. It can match possible Polycarp's game which started with x=9x=9.
题意:给出一个序列,进行排序,排序的规则为,后一个数字是前一个数字的1/3,或者是后一个数字是前一个数字的2倍
思路:DFS暴力搜素,然后记录下序列,最后在逆序输出即可
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=105;
ll a[maxn];
map<ll,int >mp;
vector<ll>v;
int n;
bool DFS(ll x,int cnt)
{
bool res=false;
if(cnt==n){
v.push_back(x);
return true;
}
if(x%3==0&&mp[x/3]){
if(DFS(x/3,cnt+1))
v.push_back(x),res=true;
}
if(mp[x*2]){
if(DFS(x*2,cnt+1))
v.push_back(x),res=true;
}
return res;
}
int main()
{
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
mp[a[i]]++;
}
for(int i=0;i<n;i++){
if(DFS(a[i],1)){
for(int i=n-1;i>=0;i--){
cout<<v[i];
if(i==0)
cout<<endl;
else
cout<<" ";
}
return 0;
}
}
return 0;
}