离散

A

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int a[100005], i, n, x;
    int flag;
    while(cin >> n)
    {
        for(i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        cin >> x;
        sort(a, a + n);
        flag = n - (find(a, a + n, x) - a);
        if(flag)
            cout << "true" << endl;
        else
            cout << "false" << endl;
    }

    return 0;
}

B

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
    int a[100005], i, n;
    int flag;
    int t, new_len;
    cin >> t;
    while(t--)
    {
        cin >> n;
        for(i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        sort(a, a + n);
        new_len = unique(a, a + n) - a;
        flag = n - new_len;
        if(flag)
            cout << "false" << endl;
        else
            cout << "true" << endl;
    }

    return 0;
}