一个有关子树的数据结构方面的问题比较困惑，请问怎么C语言实现？

Question

Problem Description
There is a complete binary tree with N nodes.The subtree of the node i has Ai nodes.How many distinct numbers are there of Ai?

Input
There are multiple test cases, no more than 1000 cases.
For each case contains a single integer N on a line.(1≤N≤1018)

Output
The output of each case will be a single integer on a line:the number of subtrees that contain different nodes.

Sample Input
5
6
7
8

Sample Output
3
4
3
5

Answer 1

https://blog.csdn.net/weixin_34320159/article/details/91342160