1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 using namespace std;
 5 const int N = 1e5 + 10;
 6 int a[N];
 7 int b[35];
 8 int main()
 9 {
10     int t;
11     scanf("%d",&t);
12     while (t--)
13     {
14         memset(b,0,sizeof(b));
15         int n;
16         scanf("%d",&n);
17         for (int i = 0;i < n;i++)
18         {
19             scanf("%d",&a[i]);
20         }
21         sort(a,a+n);
22         long long ans = 0;
23         for (int i = 0;i < n;i++)
24         {
25             int x = a[i];
26             int cnt = 0;
27             while (x)
28             {
29                 if (!(x & 1)) ans += b[cnt];
30                 cnt++;
31                 x >>= 1;
32             }
33             if (cnt == 0) continue;
34             b[cnt-1]++;
35         }
36         printf("%lld\n",ans);
37     }
38     return 0;
39 }

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 typedef long long LL;
 4 const int N = 1e5 + 5;
 5 int T, n;
 6 int a[N];
 7 int cnt[33];
 8
 9 int main() {
10     scanf("%d", &T);
11     while(T--) {
12         scanf("%d", &n);
13         for(int i = 0; i < n; i++) {
14             scanf("%d", &a[i]);
15         }
16         sort(a, a+n);
17         memset(cnt, 0, sizeof(cnt));
18         LL ans = 0;
19         for(int i = 0; i < n; i++) {
20             int x = a[i];
21             int b = 31 - __builtin_clz(x);//返回左起第一个‘1’之前0的个数。
22             for(int j = 0; j < b; j++) {
23                 if(~x&(1<<j)) ans += cnt[j];
24             }
25             cnt[b]++;
26         }
27         printf("%lld\n", ans);
28     }
29     return 0;
30 }