Problem Description
Small W gets two files. There are n integers in each file. Small W wants to know whether these two files are same. So he invites you to write a program to check whether these two files are same. Small W thinks that two files are same when they have the same integer set.
For example file A contains (5,3,7,7),and file B contains (7,5,3,3). They have the same integer set (3,5,7), so they are same.
Another sample file C contains(2,5,2,5), and file D contains (2,5,2,3).
The integer set of C is (2,5),but the integer set of D is (2,3,5),so they are not same.
Now you are expected to write a program to compare two files with size of n.
Input
Multi test cases (about 100). Each case contain three lines. The first line contains one integer n represents the size of file. The second line contains n integers a1,a2,a3,…,an - represents the content of the first file. The third line contains n integers b1,b2,b3,…,bn - represents the content of the second file.
Process to the end of file.
1≤n≤100
1≤ai,bi≤1000000000
Output
For each case, output "YES" (without quote) if these two files are same, otherwise output "NO" (without quote).
Sample Input
3 1 1 2 1 2 2 4 5 3 7 7 7 5 3 3 4 2 5 2 3 2 5 2 5 3 1 2 3 1 2 4
Sample Output
YES YES NO NO
集合问题,用set做。
#include<iostream>
#include<cstdio>
#include<set>
using namespace std;
set <long>a;
set <long>b;
set<long>::iterator iter;
set<long>::iterator iterb;
int main()
{
int t,s;
while(scanf("%d",&t)!=EOF)
{
long x;
s=0;
for(int i=0; i<t; i++)
{
cin>>x;
a.insert(x);
}
for(int i=0; i<t; i++)
{
cin>>x;
b.insert(x);
}
long xa=0,xb=0;
for (iter = a.begin(); iter != a.end(); iter++)
xa++;
for (iterb = b.begin(); iterb != b.end(); iterb++)
xb++;
if(xa!=xb)
{
cout<<"NO"<<endl;
s++;
}
else
{
for (iter = a.begin(),iterb = b.begin(); iter != a.end(),iterb != b.end(); iterb++,iter++)
{
if(*iter!=*iterb)
{
cout<<"NO"<<endl;
s++;
break;
}
}
}
if(!s)
cout<<"YES"<<endl;
a.clear();
b.clear();
}
return 0;
}