80pts求调，#2 WA

#include<bits/stdc++.h>
typedef long long LL;
LL a,b;
std::set<LL>A,B,C,D,E;
std::set<LL>U={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);
	std::cin>>a;
	for(LL i=1;i<=a;++i){
		LL x;
		std::cin>>x;
		A.insert(x);
	}
	std::cin>>b;
	for(LL i=1;i<=b;++i){
		LL x;
		std::cin>>x;
		B.insert(x);
	}
	std::set_intersection(A.begin(),A.end(),B.begin(),B.end(),std::inserter(C,C.begin()));
	std::set_union(A.begin(),A.end(),B.begin(),B.end(),std::inserter(D,D.begin()));
	std::cout<<a<<'\n';
	for(auto it=C.begin();it!=C.end();++it) std::cout<<*it<<' ';	
	std::cout<<'\n';
	for(auto it=D.begin();it!=D.end();++it) std::cout<<*it<<' ';
	std::cout<<'\n';
	for(auto it=U.begin();it!=U.end();++it) if(A.find(*it)==A.end()) std::cout<<*it<<' ';
	std::cout<<'\n';
	if(A==B) std::cout<<1<<'\n';
	else std::cout<<0<<'\n';
	bool flag=std::includes(A.begin(),A.end(),B.begin(),B.end());
	if(flag||A.empty()) std::cout<<1<<'\n';
	else std::cout<<0<<'\n';
	for(auto it=A.begin();it!=A.end();++it){
		if(!(*it)){
			std::cout<<1<<'\n';
			return 0;
		}
		else continue;
	}
	std::cout<<0<<'\n';
	return 0;
}