K - XOR Clique(水题）

K - XOR Clique

#include<stdio.h>
#include "cstring"
#include "iostream"
#include "algorithm"
using namespace std;
#define ll long long
ll b[100];
int main()
{
    long long int n,count1,i,x,sum,t;
    scanf("%lld",&t);
    while(t--)
    {
        memset(b,0,sizeof(b));
        scanf("%lld",&n);
        sum=0;
        for(i=1; i<=n; i++)
        {
            scanf("%lld",&x);
            count1=1;
            x=x/2;
            while(x)
            {
                x=x/2;
                count1++;
            }
            b[count1]++;
        }
        for(i=1;i<=84;i++)
        {
            if(b[i]>=2)
            {
                sum=max(sum,b[i]);
            }
        }
        printf("%lld\n",sum);
    }
    return 0;
}