【CUGBACM15级BC第12场 A】【STL】hdu 5058 So easy

So easy

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 803    Accepted Submission(s): 438

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

31 1 21 2 245 3 7 77 5 3 342 5 2 32 5 2 531 2 31 2 4

 

Sample Output

YESYESNONO

题意：给你两个序列，问你去重后相不相等

思路：排序去重,set的简单应用

///AC代码

/* ***********************************************┆  ┏┓　　　┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃　　　　　　　┃ ┆┆┃　　　━　　　┃ ┆┆┃　┳┛　┗┳　┃ ┆┆┃　　　　　　　┃ ┆┆┃　　　┻　　　┃ ┆┆┗━┓　马　┏━┛ ┆┆　　┃　勒　┃　　┆　　　　　　┆　　┃　戈　┗━━━┓ ┆┆　　┃　壁　　　　　┣┓┆┆　　┃　的草泥马　　┏┛┆┆　　┗┓┓┏━┳┓┏┛ ┆┆　　　┃┫┫　┃┫┫ ┆┆　　　┗┻┛　┗┻┛ ┆************************************************ */#include <iostream>#include <set>#include <map>#include <stack>#include <cmath>#include <queue>#include <cstdio>#include <bitset>#include <string>#include <vector>#include <iomanip>#include <cstring>#include <algorithm>#include <functional>#define PI acos(-1)#define eps 1e-8#define inf 0x3f3f3f3f#define debug(x) cout<<"---"<<x<<"---"<<endltypedef long long ll;using namespace std;ll a[110];ll b[110];set<long long> p, q;set<long long>:: iterator piter;set<long long>:: iterator qiter;int main(){    int n;    while (scanf("%d", &n) != EOF)    {        p.clear();        q.clear();        for (int i = 0; i < n; i++)        {            scanf("%lld", &a[i]);        }        for (int i = 0; i < n; i++)        {            scanf("%lld", &b[i]);        }        sort(a, a + n);        sort(b, b + n);        for (int i = 0; i < n; i++)        {            p.insert(a[i]);            q.insert(b[i]);        }        if (p.size() != q.size())        {            printf("NO\n");            continue;        }        int flag = 1;        for (piter = p.begin(), qiter = q.begin(); piter != p.end(), qiter != q.end(); piter++, qiter++)        {            if (*piter != *qiter)            {                flag = 0;                break;            }        }        if (flag)        {            printf("YES\n");        }        else        {            printf("NO\n");        }    }    return 0;}/************************************************┆  ┏┓　　　┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃　　　　　　　┃ ┆┆┃　　　━　　　┃ ┆┆┃　┳┛　┗┳　┃ ┆┆┃　　　　　　　┃ ┆┆┃　　　┻　　　┃ ┆┆┗━┓　  　┏━┛ ┆┆　　┃　  　┃　　┆　　　　　　┆　　┃　  　┗━━━┓ ┆┆　　┃　 AC代马 　　┣┓┆┆　　┃　        　　┏┛┆┆　　┗┓┓┏━┳┓┏┛ ┆┆　　　┃┫┫　┃┫┫ ┆┆　　　┗┻┛　┗┻┛ ┆************************************************ */