CodeChef：Good Pairs（dp & 二进制）

You are given N integers: A₁, A₂, ..., A_N. You need to count the number of pairs of indices (i, j) such that 1 ≤ i < j ≤ N and A_i | A_j ≤ max(A_i, A_j).

Note: A_i | A_j refers to bitwise OR.

Input

• The first line of the input contains an integer T, denoting the number of test cases. The description of each testcase follows.
• The first line of each testcase contains a single integer: N
• The second line of each testcase contains N integers: A₁, A₂, ..., A_N

Output

For each test case, output a single line containing the answer for that test case.

Constraints

• 1 ≤ T ≤ 20
• 1 ≤ N ≤ 10⁶
• 0 ≤ A_i ≤ 10⁶
• 1 ≤ Sum of N over all test cases ≤ 10⁶

题意：給N个数字，问有多少对数满足a[i]|a[j] <= max(a[i],a[j])，i<j。

思路：首先a[i]|a[j] >= max(a[i],a[j])，于是题目变成求a[i]|a[j] == max(a[i],a[j])，若a[i]<=a[j]，那么a[i]|a[j] == a[j]，即a[i]为a[j]的二进制子集，那么求出每个数在这N个数里有多少个它的子集即可，sum over subsets dp复杂度O(N*2^N)，N<21。

# include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 1e6;
LL num[maxn+3], num2[maxn+3];
int main()
{
    int t, n, m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(num, 0, sizeof(num));
        memset(num2, 0, sizeof(num));
        for(int i=0; i<n; ++i)
        {
            scanf("%d",&m);
            ++num[m];
            ++num2[m];
        }
        for(int i=0; i<21; ++i)
            for(int j=1; j<=maxn; ++j)
                if(j&(1<<i))
                    num[j] += num[j^(1<<i)];
        LL ans = 0;
        for(int i=0; i<=maxn; ++i)
        {
            if(num[i])
            {
                ans += num2[i]*(num2[i]-1)/2;
                ans += (num[i]-num2[i])*num2[i];
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}