F - Good Numbers (hard version)

The only difference between easy and hard versions is the maximum value of n.

You are given a positive integer number n. You really love good numbers so you want to find the smallest good number greater than or equal to n.

The positive integer is called good if it can be represented as a sum of distinct powers of 3 (i.e. no duplicates of powers of 3 are allowed).

For example:

30 is a good number: 30=33+31,
1 is a good number: 1=30,
12 is a good number: 12=32+31,
but 2 is not a good number: you can’t represent it as a sum of distinct powers of 3 (2=30+30),
19 is not a good number: you can’t represent it as a sum of distinct powers of 3 (for example, the representations 19=32+32+30=32+31+31+31+30 are invalid),
20 is also not a good number: you can’t represent it as a sum of distinct powers of 3 (for example, the representation 20=32+32+30+30 is invalid).
Note, that there exist other representations of 19 and 20 as sums of powers of 3 but none of them consists of distinct powers of 3.

For the given positive integer n find such smallest m (n≤m) that m is a good number.

You have to answer q independent queries.

Input
The first line of the input contains one integer q (1≤q≤500) — the number of queries. Then q queries follow.

The only line of the query contains one integer n (1≤n≤1018).

Output
For each query, print such smallest integer m (where n≤m) that m 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的次方组成。但不重复，不在多做说明。
上代码！！
很多人大都会按照正向思维去思考，比给出的数大的是几？这样就很容易超时，所以逆向思维很重要。可以把数逆推。
用sum依次累加3的次方。等到sum>=n时结束，然后再依次减去3的次方要>=n，停止，
例 给一个6； sum=1+3+33=1;>=6;
所以sum-1=12；
sum-3=9；
#include<stdio.h>
#include<string.h>
int main()
{
int t;
scanf("%d",&t);
while(t–)
{
long long n;
scanf("%lld",&n);
long long sum=0,x=1;
while(sum<=n)
{
sum=sum+x;
x=x3;
}
while(x)
{
if(sum-x>=n)
sum-=x;
x/=3;
}
printf("%lld\n",sum);
}
return 0;
}
参考https://blog.csdn.net/XYBDX/article/details/102846396