线性基思想+贪心——cf1249C

/*
1+3+9+...+3^n<3^(n+1),按这个思路贪心一下就好
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll p[],flag[],s[];

int main(){
    p[]=s[]=;
    for(int i=;i<=;i++)
        p[i]=p[i-]*,s[i]=s[i-]+p[i];

    int Q;cin>>Q;
    while(Q--){
        ll n;cin>>n;
        ll tmp=n,sum=;

        int flag[]={},Max=;
        for(int i=;i>=;i--)
            if(tmp>=p[i]){
                Max=max(Max,i);
                tmp-=p[i],sum+=p[i];
                flag[i]=;
            }

        if(tmp==){
            cout<<n<<'\n';
        }else if(n>s[Max]){
            cout<<p[Max+]<<'\n';
        }else {
            ll ans=,id;
            for(int i=;i<=;i++)
                if(flag[i]==){
                    id=i;break;
                }
            ans+=p[id];
            for(int i=id+;i<=;i++)
                if(flag[i])ans+=p[i];
            cout<<ans<<'\n';
        }

    }

}