hdu 3006 The Number of set

#include<string.h>
#include<math.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
const int maxn = 20;
int dp[32800], u[maxn];
int main()
{
    int i;
    u[0] = 1;
    for (i = 1; i <= 14; i++) u[i] = 2 * u[i - 1];
    int n, m, q, j, s;
    while (~scanf("%d%d", &n, &m))
    {
        memset(dp, 0, sizeof(dp));
        dp[0] = 1;
        for (i = 1; i <= n; i++)
        {
            scanf("%d", &q);
            int sum = 0;
            for (j = 0; j<q; j++)
            {
                scanf("%d", &s);
                sum = sum + u[s];
            }
            for (j = 32800 - 5; j >= 0; j--) if (dp[j] == 1) dp[j | sum] = 1;

        }
        int ans = 0;
        for (i = 0; i <= 32800 - 5; i++) if (dp[i] == 1) ans++;
        printf("%d\n", ans - 1);
    }
    return 0;
}