Codeforces Round #799 (Div. 4) 1692B.All Distinct Solution

 


Problem Link:https://codeforces.com/contest/1692/problem/B

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int x,t,i,j,o,e,n;
    cin>>t;
    while(t--)
    {
        cin>>n;
        set<int>st;
        for(i=0; i<n; i++)
        {
            cin>>x;
            st.insert(x);
        }
       o=n-st.size();
       if(o%2==0)
        cout<<st.size()<<endl;
       else
         cout<<st.size()-1<<endl;
    }
}


 





No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.