Help me in solving ADMAG problem

help
,
1

My issue

Why the answer required for n=3 is 3 when i am using the solution which was accepted shouldn’t it be {1,3} , {2} i can guess all 1 by {1,3} , 2 by {2} and 3 by {1,3} , {2} by adding 1st 2 elements 1+2.

My code

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define vi  vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<long long>
#define ff first
#define ss second
#define pii pair<int,int> 

int count(ll n){
    int cnt = 0;
    while(n>1){
        cnt++;
        n = n/2;
    }
    return cnt;
}

void solve(){
    ll n;
    cin>>n;
    
    int cnt = count(n);
    cout<<cnt+1<<endl;
}


int main() {
    ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
    
    int t;
    cin>>t;
    while(t--){
        solve();
    }
	return 0;
}

Problem Link: Aditi and Magic Trick Practice Coding Problem

2

@sho_quixote
{1,3} and 2
to make 3 as the answer 2 must contain the number u have thought of which means {1,3) and {2,3} but its also not possible because no two cards can have same integer in common but they have 3 in common .
So the result would be 3 like this {1},{2} ,{3}

3

Thanks for the confirmation it took me 12 hours to see that :melting_face: