L2-005 集合相似度

#include<cmath>
#include<string>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
typedef long long LL;
int main (int argc, char const *argv[]) {
    int N,M,i,j,cc,num;
    set<int> s[51];
    while (cin>>N) {
        for (int i=0; i<N; i++) {
            scanf ("%d",&cc);
            while (cc--) {
                scanf ("%d",&num);
                s[i].insert (num);
            }
        }
        scanf ("%d",&M);
        int cnt;
        set<int>::iterator it;
        while (M--) {
            cnt=0;
            scanf ("%d %d",&i,&j);
            i--,j--;
            for (it=s[i].begin(); it!=s[i].end(); it++) {
                if (s[j].count (*it) ) { cnt++; }
            }
            printf ("%.2f%\n", (double) cnt/ (double) (s[i].size()+s[j].size()-cnt) *100);
        }
    }
    return 0;
}