题解 | 小q的数列

#include <stdio.h>
typedef long long ll;

ll count_num(ll n) {
    if (n == 0)
        return 0;
    else if (n == 1)
        return 1;
    else{
        return count_num(n / 2) + count_num(n % 2);
    }
}
int main(void) {
    int t;
    scanf("%d", &t);
    ll n;

    while (t--) {
        scanf("%lld", &n);
        ll ans = count_num(n);
        printf("%lld %lld\n", ans, (1LL << ans) - 1);
    }
    return 0;
}