pypy3(pypy3.6.1) 解法, 执行用时: 45ms, 内存消耗: 19188K, 提交时间: 2021-01-31 17:58:56

x, y = 1, 1
C = [1,2]
s = 2
ans = 0
for i in range(59):
	x, y = x + y, x
	s += x
	C.append(s)
def div(n):
    for i in range(59):
        if C[i] >= n:
            break
    if n == 1 or n == 0:
        return n
    else:
        return (1 << (i)) + div(n - C[i - 1] - 1)
T = int(input())
for _ in range(T):
    u = int(input())
    print(div(u))

C++11(clang++ 3.9) 解法, 执行用时: 3ms, 内存消耗: 472K, 提交时间: 2020-02-29 14:13:36

#include<iostream>
using namespace std;
long long f[100];
int main()
{
	f[0]=f[1]=f[2]=1;
	for(int i=3;i<64;i++)
	f[i]=f[i-1]+f[i-2];
	int  t;
	cin>>t;
	while(t--)
	{
		long long n,ans=0,d;
		cin>>n;
		while(n)
		{
			int i=0;
			while(n>=f[i])
			{
				n-=f[i];
				i++;
			}
			d=1;
			ans+=(d<<(i-1));
		}
		cout<<ans<<endl;
	}
	return 0;
}