感觉没问题，不知道错哪

#include <cstdio>

using namespace std;

typedef long long LL;
int n;
int path[10010];

bool dfs(int u, int depth)
{
    if (u == depth + 1) return path[u - 1] == n;
    
    for (int i = u - 1; i >= 1; --i)
        for (int j = i; j >= 1; --j)
        {
            int s = path[i] + path[j];
            if (s <= path[u - 1]) return false;
            if ((LL)s * (1ll << (depth - u + 1)) < n) return false;
            if (s > path[u - 1] && s <= n && s <= (path[u - 1] << 1))
            {
                path[u] = s;
                if (dfs(u + 1, depth)) return true;
            }
        }
    
    return false;
}

int main()
{
    int T = 0;
    while (scanf("%d", &n), n)
    {
        ++ T;
        if (T > 1) puts("");
        int depth = 1;
        path[1] = 1;
        while (!dfs(2, depth)) ++ depth;
        
        for (int i = 1; i < depth; ++i)
            printf("%d ", path[i]);
        printf("%d", path[depth]);
    }
    return 0;
}