CodeForces - 977D:Divide by three, multiply by two

题目
Polycarp likes to play with numbers. He takes some integer number x, writes it down on the board, and then performs with it n−1 operations of the two kinds:

• divide the number x by 3 (x must be divisible by 3);
• multiply the number x by 2.

After each operation, Polycarp writes down the result on the board and replaces x by the result. So there will be n numbers on the board after all.

You are given a sequence of length n — 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.

题意
P君喜欢对一个数进行n-1次操作，每次会随机进行一种：

1. x/=3(x必须可以整除3)
2. x*=2

P君把每一步的结果都写在黑板上，但是P君比较随意，导致答案写的到处都是。

现在把黑板上所有的数字全都给你，希望你能给出一个合适的顺序使得这个序列满足上述操作。
答案不唯一。
（不懂就看一下样例1，推演一下）

思路
思维题，需要想的稍微深一点。
我们假设P君优先对数字进行1操作，再是2操作。
有了优先级，那么能被1操作处理次数多的就放在前面，如果一样多就值小的放前面。

举例，样例1的答案：9 3 6 12 4 8 ：
9可以用1操作处理2次，所以靠前；3和6都是1次，但3比6小，所以3排在6前。

注意数据大小！！！
看代码，伊丽莎白！

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[105];
bool cmp(ll x,ll y)
{
    ll k1=0,k2=0;
    while(x%3==0)
    {
        x/=3;
        k1++;
    }
    while(y%3==0)
    {
        y/=3;
        k2++;
    }
    if(k1==k2)
        return x<y;
    return k1>k2;
}
int main()
{
    ll n;
    cin>>n;
    for(ll i=0;i<n;i++)
        cin>>a[i];
    sort(a,a+n,cmp);
    for(ll i=0;i<n;i++)
    {
        if(i)
            cout<<' ';
        cout<<a[i];
    }
    cout<<endl;
}

洗袜子！