UVA 10825

UVA 11825
状态压缩 这里经典的地方就是k0集合的取值，k0=k,k0,k0=(k0-1)&k，以前还一直不知道该怎么表达k的集合，这次学到了

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#define up(i,a,b)  for(int i=a;i<b;i++)
#define dw(i,a,b)  for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const long long INF = 0x3f3f3f3f;
using namespace std;
int n, m, x;
int cishu;
int s[20];
int temp[1 << 16];
int dp[1<<16];
int main()
{
	while (cin >> n && n)
	{
		memset(dp, 0, sizeof(dp));
		up(i, 0, n)
		{
			cin >> m;
			s[i] = 1 << i;
			up(j, 0, m)
			{
				cin >> x;
				s[i] |= (1<<x);
			}
		}
		up(k, 0, (1<<n))
		{
			temp[k] = 0;
			up(i, 0, n)
			{
				if (k&(1 << i))
				{
					temp[k] |= s[i];
				}
			}
		}
		int all = (1 << n) - 1;
		up(k, 1, (1 << n))
		{
			dp[k] = 0;
			for (int k0 = k; k0; k0 = (k0 - 1)&k)
			{
				if(temp[k0]==all)
					dp[k] = max(dp[k], dp[k^k0] + 1);
			}
		}
		printf("Case %d: %d\n", ++cishu, dp[all]);
	}
	return 0;
}