Learning to write efficient and effective algorithm.

 Hi, I am Aman Kumar pursuing BCA II. I have decided to write what i learn daily.

I request you to please go through this program and feel free to write me if you have any advice/suggestions for me at 2022amankumar@gmail.com 

I recently solved a question on CodeChef with Problem Code:ALEXNUMB. 

My designed solution was:

#include <iostream>

#include <set>

using namespace std;

typedef unsigned long long LL;

int main() {

    LL T,n,m,a,result;

    cin>>T;

    while(T--)

    {

        cin>>n;

        set<LL>temp;

        for(int i=0;i<n;i++)

        {

            cin>>a;

            temp.insert(a);

        }

        m=temp.size();

        result=((m-1)*m)/2; //to find total no pairs,i used set theory

        cout<<result<<endl;

    }

return 0;

}

My solution was correct and hence got accepted.

Output: