Good Numbers

The only difference between easy and hard versions is the maximum value of nn You are given a positive integer number nn
. You really love good numbers so you want to find the smallest good number greater than or equal to nn
.The positive integer is called good if it can be represented as a sum of ditinct powers of 33 (i.e. no duplicates of powers of 33 are allowed).Forexample: 3030
is a good number: 30=33+3130=33+31
, 11
is a good number: 1=301=30
, 1212
is a good number: 12=32+3112=32+31
, but 22
is not a good number: you can’t represent it as a sum of distinct powers of 33
(2=30+302=30+30
), 1919
is not a good number: you can’t represent it as a sum of distinct powers of 33
(for example, the representations 19=32+32+30=32+31+31+31+3019=32+32+30=32+31+31+31+30
are invalid), 2020
is also not a good number: you can’t represent it as a sum of distinct powers of 33
(for example, the representation 20=32+32+30+3020=32+32+30+30
is invalid). Note, that there exist other representations of 1919
and 2020
as sums of powers of 33
but none of them consists of distinct powers of 33
.For the given positive integer nn
find such smallest mm
(n≤mn≤m) that mm
is a good number.You have to answer qq
independent queries.InputThe first line of the input contains one integer qq
(1≤q≤5001≤q≤500
) — the number of queries. Then qq
queries follow.The only line of the query contains one integer nn
(1≤n≤10181≤n≤1018
).OutputFor each query, print such smallest integer mm
(where n≤mn≤m
) that mm
is a good number.
For each query, print such smallest integer mm (where n≤mn≤m) that mm is a good number.Example
Input
8
1
2
6
13
14
3620
10000
1000000000000000000
Output
1
3
9
13
27
6561
19683
1350851717672992089
题目的意思是 给定一个数，让3的幂次方相加的最小数大于等于给定的这个数，但是3的幂次方不能重复，直接上代码。
注意要开long long。

#include<stdio.h>
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        long long n;
        scanf("%lld",&n);
        long long sum=0,s=1;
        while(sum<=n)
        {
            sum=sum+s;
            s=s*3;
        }
        while(s)
        {
            if(sum-s>=n)
                sum=sum-s;
            s=s/3;
        }
        printf("%lld\n",sum);
    }
    return 0;
}