PAT 1063

#include<cstdio>#include<iostream>#include<string>#include<string.h>#include<algorithm>#include<queue>#include<map>#include<set>using namespace std;int main(){	//freopen("input.txt","r",stdin);	int n;	int m;	int k;	scanf("%d",&n);	set<int> a[51],temp;	int t;	for(int i=0;i<n;i++)	{		scanf("%d",&m);		for(int j=0;j<m;j++)		{			cin>>t;			a[i].insert(t);		}	}	int num;	cin>>num;	int b,c;	int nc,nt;	double per;	for(int i=0;i<num;i++)	{		cin>>b>>c;		b=b-1;		c=c-1;		nc=0;		nt=a[b].size();		for(set<int>::iterator it=a[c].begin();it!=a[c].end();it++)		{			if(a[b].find(*it)==a[b].end())				nt++;			else				nc++;		}				per=double(nc)/double(nt)*100;		PRintf("%.1lf%%/n",per);	}	//freopen("con","r",stdin);	system("pause");	return 0;}