L1-020 帅到没朋友 (20 分)

思路：一维数组记录出现在朋友圈的id;用于判断查询的id是否存在于朋友圈

坑点：1.有的朋友圈只有一个人，这个人不算是有朋友的人。2.如果id为 1 ，则输出补零00001

#include <iomanip>
#include <iostream>
using namespace std;
int flag[100500]={0};
int main()
{
	int n, m,id;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> m;if(m==1){cin>>m;continue;}
		for (int i = 0; i < m; i++)
		{
			cin >> id; flag[id] = 1;
		}
	}
	int M, hm[100500] = { 0 }, count = 0, last = 0,hmid[100500] = { 0 };
	cin >> M;
	for (int i = 0; i < M; i++)
	{
		cin >> id; if (flag[id] == 0&&hmid[id]!=-1) { hmid[id] = -1; hm[count++] = id; last = id; }
	}
	if (count == 0)
	{
		cout << "No one is handsome" << endl; return 0;
	}
	
	for (int i = 0; i < count - 1; i++)
		cout <<setw(5)<< setfill('0')<< hm[i] << " ";
	cout <<setw(5)<< setfill('0')<< last << endl;
}